3. Sorting Algorithms

This chapter discusses different types of sorting algorithms and benchmarks their performance in terms of comparisons and assignments.

Contents

1. Abstraction

2. Comparison-based Sort

3. Divide & Conquer Sort

4. Distribution-based Sort

5. Quiz

6. Homework

Resources

• Main: src/main/java/edu/emory/cs/sort

• Test: src/test/java/edu/emory/cs/sort

References

• Comparison-based Algorithms

  • Selection Sort $\rightarrow$ Heap Sort

  • Insertion Sort $\rightarrow$ Shell Sort

• Divide and Conquer Algorithms

  • Merge Sort $\rightarrow$ Tim Sort

  • Quick Sort $\rightarrow$ Intro Sort

• Distribution-based Algorithms

  • Bucket Sort

  • Radix Sort