Learn Sorting Algorithms with Python

Learn about the usefulness and efficiency of computational sorting by implementing different sorting algorithms yourself.

### Why Learn Sorting Algorithms?

Sorting numbers is one of the most commonly used computer science operations. There is an abundance of data in our digital world and sorting makes it easier to find what you're looking for. Proficiency in this topic will help prepare you for your next coding interview.

### Take-Away Skills:

Implement and analyze the performance of several sorting algorithms. Discover the inner-workings of one of the most demanding calculation tasks.

### Notes on Prerequisites:

Basic understanding of Python will be necessary to implement the algorithms.

• Bubble Sort: Learn about bubble sort, an introductory sorting algorithm that iterates through a list and compares pairings of adjacent elements.
• Lesson: Bubble Sort: Conceptual
• Quiz: Bubble Sort: Conceptual
• Lesson: Bubble Sort: Python
• Quiz: Bubble Sort: Python
• Merge Sort: Learn about merge sort, a divide-and-conquer algorithm, which breaks items into smaller elements until sorting them becomes really simple.
• Lesson: Merge Sort: Conceptual
• Quiz: Merge Sort: Conceptual
• Lesson: Merge Sort: Python
• Quiz: Merge Sort: Python
• Quicksort: Learn about quicksort, an efficient recursive algorithm for sorting arrays or lists of values.
• Lesson: Quicksort: Conceptual
• Quiz: Quicksort: Conceptual
• Lesson: Quicksort: Python
• Quiz: Quicksort: Python
• Radix Sort: Learn about radix sort, an algorithm that operates on numbers digit by digit.
• Lesson: Radix Sort: Conceptual
• Quiz: Radix Sort: Conceptual
• Lesson: Radix Sort: Python
• Quiz: Radix Sort: Python
• Sorting Comprehensive: Practice your sorting skills with this comprehensive unit.
• Project: A Sorted Tale