Sorting Algorithms in 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.
Codecademy courses have been taken by employees at
What you'll learn
- 1Learn about bubble sort, an introductory sorting algorithm that iterates through a list and compares pairings of adjacent elements.
- 2Learn about merge sort, a divide-and-conquer algorithm, which breaks items into smaller elements until sorting them becomes really simple.
- 3Learn about quicksort, an efficient recursive algorithm for sorting arrays or lists of values.
- 4Learn about radix sort, an algorithm that operates on numbers digit by digit.
- 5Practice your sorting skills with this comprehensive unit.
What you'll create
Portfolio projects that showcase your new skills
How you'll master it
Stress-test your knowledge with quizzes that help commit syntax to memory
— Madelyn, Pinterest“I know from first-hand experience that you can go in knowing zero, nothing, and just get a grasp on everything as you go and start building right away.”