Computer Science 269
Introduction to Data Structures
Spring 2000
Summary of Sorting Algorithms
Briefly describe each of
the sorting algorithms we have discussed this semester. These include:
-
Bubblesort.
-
Array implementation of Selection Sort.
-
Heap implementation of Selection Sort.
-
Array implementation of Insertion Sort.
-
Binary Search Tree implementation of Insertion Sort.
-
AVL Tree implementation of Insertion Sort.
-
Quicksort.
-
Mergesort.
-
Polyphase Mergesort.
-
Tournament Sort.
-
Bucket Sort.
Make a table showing the worst case time complexity, average space
time complexity, and worst case workspace complexity of each algorithm.
