Adobe Interview Question: Explain few sorting algorithm. What are their complexities ?

Skip to content Skip to footer

Community
Jobs
Companies
Salaries
For Employers

Notifications

Adobe

Adobe Software Engineer interview

Adobe Interview Question

Software Engineer Interview

Explain few sorting algorithm. What are their complexities ?

Interview Answers

Anonymous

Mar 16, 2012

False. Merge sort is always nlogn.

Anonymous

Nov 26, 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.

Adobe interviews

Adobe

Adobe Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches