Posted by: bairagiKancho September 12, 2012
algorithm
Login in to Rate this Post:     0       ?        
if n<100, O(n^2) runs faster then O(nlogn) - should be for some value of k.

Hope it helps.

Read Full Discussion Thread for this article