Interview Question

Software Development Engineer II Interview Redmond, WA

Different Sorting Algorithms and Big O of each

Answer

Interview Answer

2 Answers

0

Average cases:
Heap sort O(n lg n)
Insertion sort O(n^2)
Quicksort O(n lg n)
Merge sort O(n lg n)
Bubble sort O(n lg n)

Javier on Aug 6, 2010
0

Bubble sort is O(n2)..

Gee on Sep 30, 2011

Add Answers or Comments

To comment on this question, Sign In with Facebook or Sign Up