Pergunta de entrevista da empresa Adobe

Explain few sorting algorithm. What are their complexities ?

Respostas da entrevista

Sigiloso

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.

Sigiloso

16 de mar. de 2012

False. Merge sort is always nlogn.