Domanda di colloquio di Adobe
Explain few sorting algorithm. What are their complexities ?
Risposte di colloquio
Anonimo
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.