CSE 214 Computer Science II (Spring 2015)
RECITATION 11 – Heap and Binary Search Tree
Objective:
2. To study Sorting Algorithms
Key ={65, 90, 66, 89, 67, 88, 68, 87, 69, 86, 70}
Show the deletion of keys: 70, 86, 69 and 87
Fill in the following table giving the best/worst case order of complexity for the following sorting algorithms. Briefly describe when these cases occur.
Sorting Algorithm | Best Case Complexity | Worst Case Complexity |
Bubble | ||
Selection | ||
Merge | ||
Quick | ||
Radix |
Simulate the four types of sorts using the following array:
{3, 7, 1, 4, 2, 5, 8, 6}