Sorting Algorithms in Python (Animation-Based)

Focused View

Carmine Caiaro

4:33:36

80 View

1. Introduction

1. Introduction to sorting algorithms.mp4

06:46

2. PLEASE WATCH - Note on for loops in this course.mp4

04:00

3. A brief introduction to Big O notation.mp4

12:14

4. Master theorem.mp4

02:06

2. Bubble Sort

1.1 bubblesort code.zip

1. Code for this section.html

2. Bubble Sort - Introduction, code and examples.mp4

12:43

3. Bubble Sort - Analysis.mp4

14:40

3. Selection Sort

1.1 selectionsort code.zip

1. Code for this section.html

2. Selection Sort - Introduction, code and examples.mp4

11:42

3. Selection Sort - Analysis.mp4

05:50

4. Insertion Sort

1.1 insertionsort code.zip

1. Code for this section.html

2. Insertion Sort - Introduction, code and examples.mp4

22:33

3. Insertion Sort - Analysis.mp4

11:11

5. Quick Sort

1.1 quicksort code.zip

1. Code for this section.html

2. Quick Sort - Introduction, code and examples.mp4

26:33

3. Quick Sort - Detailed example.mp4

25:01

4. Quick Sort - Analysis.mp4

23:54

6. Merge Sort

1.1 mergesort code.zip

1. Code for this section.html

2. Merge Sort - Introduction, code and examples.mp4

33:24

3. Merge Sort - Analysis.mp4

11:57

7. Heap Sort

1.1 heapsort code.zip

1. Code for this section.html

2. Heap Sort - Introduction, code and examples.mp4

43:19

3. Heap Sort - Analysis.mp4

05:43

Description

Implement and understand sorting algorithms through animations. Master sorting for your next coding interview!

What You'll Learn?

Six important comparison based sorting algorithms: Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort and Heap Sort.
Relate each line in the code with its purpose in the algorithm.
How to implement the covered sorting algorithms in Python.
Compare the efficiency of sorting algorithms using the Big O Notation.

Who is this for?

Computer Science Students

College Graduates

Software engineers

What You Need to Know?

Basic programming (Data types, variables, loops, functions, etc.)

Basic math for the time complexity analysis (Summations, functions, etc.)

To run the code and experiment by yourself, you will need to have Python 3 installed on your device.

More details

Description
Sorting is a fundamental concept in computer science and is essential for many applications.
This course will teach you through detailed animations how the most important sorting algorithms work and how to implement them in Python. By the end of this course, you will have an excellent understanding of the six popular sorting algorithms: Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort and Heap Sort.
We will start in the first section with an introduction to sorting, the Big O notation, and a rough overview over the master theorem.
For each sorting algorithm, there is a separate section, where we'll delve into at least two videos.
The first video serves always as an introduction to the underlying algorithm, covering its core concept, the corresponding Python code, and practical examples.
An additional example video is available for Quick Sort, as it can be a challenging algorithm for beginners to understand. By providing a very detailed example, the corresponding video aims to simplify the learning process and help learners gain a better understanding of the connection of Quick Sort and its implementation.
In the second video, we conduct a comprehensive analysis of the algorithm's properties. This includes mainly examining its stability, whether it performs in-place sorting, as well as its time complexity under various cases such as best, average, and worst-case scenarios.
This course is for anyone who wants to gain a better understanding of sorting algorithms and a bit of Python programming. Join this course today and take the first step in becoming an expert in sorting!
Who this course is for:
Computer Science Students
College Graduates
Software engineers

User Reviews

Rating

average 0

Total votes0

Focused display

Hello, my name is Carmine and I am 24 years old. Currently I am studying mathematics in Germany.My subsidiary subject is computer science. I found my passion in the combination of these subjects, in the numerical analysis where I want to share my understanding and my knowledge now with other people.

Udemy

View courses Udemy

Students take courses primarily to improve job-related skills.Some courses generate credit toward technical certification. Udemy has made a special effort to attract corporate trainers seeking to create coursework for employees of their company.