Pregunta de entrevista de Adobe

Explain few sorting algorithm. What are their complexities ?

Respuestas de entrevistas

Anónimo

26 de nov de 2011

Common sorting algorithms are quick sort, heap sort, merge sort. Heap sort has nlogn order for all cases. Quick sort has average order nlogn but worst case can be n^2. Same with merge sort.

Anónimo

16 de mar de 2012

False. Merge sort is always nlogn.