Introduction to Sorting Algorithms in Python

Liam Pulsifer
Liam Pulsifer 13 Lessons 1h 38m intermediate algorithms

Sorting is a basic building block that many other algorithms are built upon. It’s related to several exciting ideas that you’ll see throughout your programming career. Understanding how sorting algorithms in Python work behind the scenes is a fundamental step toward implementing correct and efficient algorithms that solve real-world problems.

In this course, you’ll learn:

  • How different sorting algorithms in Python work and how they compare under different circumstances
  • How Python’s built-in sort functionality works behind the scenes
  • How different computer science concepts like recursion and divide and conquer apply to sorting
  • What Big O notation is and how to use it to compare the efficiency of different algorithms

What’s Included:

  • 13 Lessons
  • Video Subtitles and Full Transcripts
  • 2 Downloadable Resources
  • Accompanying Text-Based Tutorial
  • 4 Hands-On Coding Exercises
  • Q&A With Python Experts: Ask a Question
  • Certificate of Completion

Downloadable Resources:

Related Learning Paths:

About Liam Pulsifer

Liam is a software engineer and avid Pythonista. When he's not writing code to automate all of his daily tasks, you can often find him running, playing basketball and tennis, reading, or eating good food.

» More about Liam

Each tutorial at Real Python is created by a team of developers so that it meets our high quality standards. The team members who worked on this tutorial are:

← Browse All Courses