07 Sorting 1

ACM Body of Knowledge

• AL/Fundamental Data Structures and Algorithms

  • Topics:

    • [Core-Tier1]

      • Worst or average case O(N log N) sorting algorithms (quicksort, heapsort, mergesort)

  • Learning Outcomes:

    • [Core-Tier1]

      • 3. Be able to implement common quadratic and O(N log N) sorting algorithms. [Usage]

Lesson

Key Resources

• Textbook

  • Chapter 6. Sorting. Sorting General Background. Exchange Sorts. Selection and Tree Sorting.

    • When reading textbooks, use the SQ3R technique.

• Brilliant Course

  • Sorting

• Tutorial

  • Sorting Techniques

    • Bubble Sort

    • Selection Sort

    • Shell Sort

• Topics

  • Worst or average case O(N log N) sorting algorithms

    • quicksort

      • Quicksort algorithm mycodeschool (20:38)

    • heapsort

      • Heap sort in 4 minutes (4:12)

    • mergesort

      • Merge sort algorithm mycodeschool (18:19)

  • Algorithmiccomplexity.com Algorithms Sorting

  • Sorting KhanAcademy

Test Yourself

Exercise Resources