Udemy

Python Searching & Sorting Algorithms - A Practical Approach

Enroll Now
  • 795 Students
  • Updated 7/2022
4.8
(70 Ratings)
CTgoodjobs selects quality courses to enhance professionals' competitiveness. By purchasing courses through links on our site, we may receive an affiliate commission.

Course Information

Registration period
Year-round Recruitment
Course Level
Study Mode
Duration
6 Hour(s) 55 Minute(s)
Language
English
Taught by
Estefania Cassingena Navone
Rating
4.8
(70 Ratings)

Course Overview

Python Searching & Sorting Algorithms - A Practical Approach

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

Learn how to implement Searching and Sorting algorithms in Python. Understand how they work behind the scenes through a detailed visual and practical approach. Be able to relate each line of code to the actual inner workings of the algorithms as they run.

Enter the World of Computer Science and Algorithms with the Right Skills.

  • Learn how to implement these algorithms in Python.

  • Be able to explain how they work behind the scenes.

  • Learn how to compare them based on their efficiency.

  • Be able to apply them to new scenarios.

Add New Skills To Your Algorithmic Toolbox

Basic knowledge of algorithms is vital for every developer. Searching and Sorting algorithms is a key topic commonly asked during technical interviews. Be one step ahead of your competition by learning these skills with this on-demand course. Python is the most popular and approachable programming language and its popularity continues to rise year-over-year.

Having a firm grasp of Searching and Sorting algorithms will not only help you during your job search, it will also enhance your computational thinking skills. Be able to dive into more advanced algorithms with the solid foundation that this course provides. With detailed and didactic slides, animations, explanations, and exercises, you will dive into the world of algorithms through an engaging and practical learning experience.

Content & Overview

With high quality video lectures that include graphics and animations, you will learn the following algorithms:

  • Linear Search

  • Binary Search

  • Bubble Sort

  • Selection Sort

  • Insertion Sort

  • Merge Sort

  • Quicksort

You will also learn how to use the timeit module to time the execution of small code snippets.

Course by the Numbers

  • 1,050+ PDF slides.

  • 96+ quiz questions.

  • 23+ Downloadable Python files.

  • 10+ PDF handouts.

  • 10 coding exercises.

  • 9 mini projects.

Learning Material & Practice:

  • High-Quality Video Lectures - Carefully designed graphics and animations.

  • Coding Exercises with detailed solutions - Execute and test your code directly in the browser.

  • Mini Projects with detailed solutions - Dive deeper into each algorithm by completing a mini project per section.

  • Quizzes - Test your knowledge and receive instant feedback.

  • Code with Print Statements - See how the algorithms work behind the scenes as the code runs.

  • PDF Handouts - Each section has a PDF handout with a graphical and detailed summary of the algorithm.

  • PDF Slides - You can download the PDF slides displayed in the videos.

  • Articles - Detailed descriptions of key aspects of the topics to complement your knowledge.

Why is this course unique?

This course is unique because of its emphasis on providing visual and detailed explanations of how the algorithms work behind the scenes, so you will not only learn how to implement them in Python, you will also learn how they work in such detail that you will be able to explain and visualize the steps of the process, given a particular input.

You will see how the algorithms work behind the scenes as the code runs with downloadable Python files that contain implementations with carefully designed print statements. No more trying to guess what is happening behind the scenes when the algorithm runs!

You will have access to unique downloadable PDF handouts specially designed for the course (one per section) with complete and graphical descriptions of the algorithms.  

If you need to learn or refresh the basics of lists, tuples, and algorithmic time complexity, the course has you covered. The Quick Refresher section offers a short but comprehensive introduction to these topics through interactive video lectures, exercises, and didactic PDF handouts. 

You will check your knowledge with short Quizzes after each main lecture. The Quizzes provide instant feedback, so you can see the correct answer immediately. The quiz questions were designed to make you think more deeply about the topics presented.

You will be able to download the PDF slides used in the videos, so you can take your learning material with you even if you don't have an internet connection when you commute to work. Study algorithms anywhere, at any time.

Finally, you will practice communications skills in the Mini Projects (one per section), where you will explain how the algorithms work step by step when they are applied to a particular input. Each mini project comes with a sample answer, so you will always be able to check your solution. Being able to explain how the algorithms work is a key skill during interviews.


You are very welcome to watch the preview lectures and check out the full course curriculum.

What are you waiting for? If you are looking for an engaging, visual, and practical course, you've found it.

Add "Searching and Sorting Algorithms in Python" to your resume and showcase your new skills!


Course Content

  • 10 section(s)
  • 124 lecture(s)
  • Section 1 Welcome to the Course
  • Section 2 Quick Review: Lists, Tuples, and Algorithmic Time Complexity
  • Section 3 Linear Search - The Most Intuitive Search Algorithm
  • Section 4 Binary Search - An Efficient Search Algorithm
  • Section 5 Bubble Sort - Your First Sorting Algorithm
  • Section 6 Selection Sort - Optimizing the Process
  • Section 7 Insertion Sort - Build the List One By One
  • Section 8 Merge Sort - Where True Efficiency Begins
  • Section 9 Quicksort - Time and Space Efficiency in One Algorithm
  • Section 10 Use the timeit Module to Compare Efficiency

What You’ll 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.


Reviews

  • K
    Kornel Sarzynski
    4.5

    the quality of video editing could be a bit better, and at some moments i think that the concepts might have been explained a bit more clearly(i think that might be due to english not being this persons first language). Overall this is a great course though because it doesn't skip through anything and even repeats the most important concepts multiple time, so it's very easy to understand sorting algorithms with this course. I would definetly recomend it to anyone needing to learn sorting algorithms without basically any previous knowledge on the matter, although a computer science background is very helpful, but why else would you really want to learn them anyway... ;)

  • O
    Olivio Armando Cordeiro Júnior
    5.0

    So far I have enjoyed very much the course. Explanations are clear and exercises are useful.

  • A
    Andreas Draxl
    4.5

    quite intresting, usecases i miss a bit

  • M
    Mendes Romeo
    5.0

    So far it is great. I love it

Start FollowingSee all

We use cookies to enhance your experience on our website. Please read and confirm your agreement to our Privacy Policy and Terms and Conditions before continue to browse our website.

Read and Agreed