Question d’entretien chez Adobe

Explain few sorting algorithm. What are their complexities ?

Réponses aux questions d'entretien

Utilisateur anonyme

26 nov. 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.

Utilisateur anonyme

16 mars 2012

False. Merge sort is always nlogn.