Pregunta de entrevista de Amazon

Print largest m number of U8 array- Time complexity =O(n)