[phyrrus9]

Then what if nlogn < 5? Your algorithm would be worse than nlogn there too.

Code:

if (list_size <= 5)     memcpy(largest, list, list_size * sizeof(int); else {     // actual algo goes here } for (i = 0; i < 5 && i < list_size; ++i) // not part of the algo, this is just printing the results     printf("%d\n", largest[i]);

In that case, then I could do the same...

Remember, solving the problem is only one part of the question, and it's not a very significant one