Description
Sorting Algorithms in Python (Animation-Based) course. Sorting is a fundamental concept in computer science and is essential for many applications. This course teaches 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 six popular sorting algorithms: bubble sort, selection sort, insertion sort, quick sort, merge sort, and heap sort. We begin in the first section with an introduction to sorting, Big O notation, and an overview of the main theorem. For each sorting algorithm, there is a separate section where we will examine at least two videos. The first video always serves as an introduction to the underlying algorithm, covering its core concept, relevant Python code, and practical examples. An additional example video is available for quick sorting, as it can be a challenging algorithm for beginners. The purpose of the corresponding video is to simplify the learning process by providing a very detailed example and help learners better understand the connection between quick sort and its implementation. In the second video, we do a comprehensive analysis of the features of the algorithm. This mainly involves checking its stability, performing in-place sorting as well as its time complexity in different cases such as best, average and worst case scenarios. This course is for those who want to gain a better understanding of sorting algorithms and some Python programming. Join this course today and take the first step to becoming a sorting expert!
What you will learn in the Sorting Algorithms in Python (Animation-Based) course
-
Six important comparison-based sorting algorithms: bubble sort, selection sort, insertion sort, quick sort, merge sort, and heap sort.
-
Match each line of code with its purpose in the algorithm.
-
How to implement covered sorting algorithms in Python
-
Compare the efficiency of sorting algorithms using big O notation.
This course is suitable for people who
- Computer science students
- College graduates
- Software engineers
Details of the course Sorting Algorithms in Python (Animation-Based)
- Publisher: Udemy
- teacher: Carmine Caiaro
- Training level: beginner to advanced
- Training duration: 4 hours and 34 minutes
- Number of courses:
Topics of the course Sorting Algorithms in Python (Animation-Based)
Prerequisites of the course Sorting Algorithms in Python (Animation-Based)
- 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.
Course images
Sample video of the course
Installation guide
After Extract, view with your favorite Player.
English subtitle
Quality: 720p
download link
File(s) password: www.downloadly.ir
Size
1.08 GB
Be the first to comment