Python Searching & Sorting Algorithms – A Practical Approach

Implement searching and sorting Algorithms in Python and learn how they work through engaging animations and projects.

Created by: Estefania Cassingena Navone
Software Developer, Instructor and Technical Writer

What Will I Learn?

• How to Implement Searching and Sorting Algorithms in Python.
• Visualize how they work behind the scenes as the code runs.
• Compare the efficiency of these algorithms using Big O Notation.
• Relate each line of code with its main purpose in the algorithm.
• Learn the best case, the average case, and the worst case of each algorithm.
• Explain how these algorithms work and apply them to new scenarios.

Requirements

• You will need to have Python 3 installed in your device.
• Basic Python Knowledge such as data types, variables, loops, conditionals, and functions.
• The Quick Refresher section offers a quick introduction to lists, tuples, and algorithmic time complexity.
• Basic Knowledge of Recursion - This is required for certain algorithms, so I provide links to helpful resources in case you need to refresh your knowledge.

Target audience

• New programmers who have learned the basics of Python.
• Developers who wish to expand their algorithmic toolbox.
• Self-taught developers and Computer Science Students.
• Programmers who need to refresh their knowledge.
• Developers who are preparing for an interview.