This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Average and Worst: O(n^2). This can be improved when the elements are not too far from their correct positions. Usually performs more poorly than other 0(n^2) sorts. Merge Sort:Average and Worst Case: O(nlog(n))Best case usually takes about half the amount of iterations as the worst case. Benjamin Smith Alex Packard Selection Sort:O(n^2) Generally faster than bubble sort but slower than insertion sort. Insertion Sort:Best Case: O(n). Occurs when the list is already sorted.Average Case: O(n^2). Faster when list is almost sorted.Worst Case: O(n^2). Occurs when list is in reverse order.Generally faster than selection sort. Quick Sort:Average Case: O(nlog(n))Worst Case: O(n^2) Mystery Sorts:We will research other sorting algorithms whose performance seems to be similar to the mystery sorts and decide which algorithm matches each sort....
View
Full Document
 Spring '08
 WORMER
 Sort, Benjamin Smith, Alex Packard, Smith Alex Packard, Benjamin Smith Alex

Click to edit the document details