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 start with an introduction to sorting, Big O notation, and an overview of the main theorem in the first section. 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, including its basic concept, relevant Python code, and practical examples. An additional sample video is available for Quick Sort, as it can be a challenging algorithm for beginners. The related videos aim 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 comprehensively analyze the features of the algorithm. This mainly includes checking its stability, in-place sorting as well as checking its time complexity in different cases like best, average, and worst case. 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 towards 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 in the algorithm to its purpose.
-
How to implement the sorting algorithms covered in Python
-
Compare the efficiency of sorting algorithms using big O notation.
This course is suitable for those who
- computer science student
- college graduates
- software Engineer
Description of Sorting Algorithms Course in Python (Animation-Based)
- Publisher: Udemy
- Lecturer: Carmine Cairo
- Training level: Beginner to advanced
- Training duration: 4 hours and 34 minutes
- Number of courses:
Course Topics Sorting Algorithms in Python (Animation-Based)
Course Prerequisites Sorting Algorithms in Python (Animation-Based)
- Basic programming (data types, variables, loops, functions, etc.)
- Basic math for time complexity analysis (summaries, functions, etc.)
- To run the code and experiment for yourself, you need to have Python 3 installed on your device.
Course Images
Sample video of the course
installation Guide
After extract, watch with your favorite player.
English subtitle
Quality: 720p
download link
File Password: www.downloadly.ir
size
1.08 GB