Description

Course content

• Introduction to the Course
  • Relevance and Evolution of Searching and Sorting Algorithms
  • Welcome to the Course | Please Introduce Yourself
  • Basic Structure of Each Section
  • Special Course Souvenir
  • Purpose of the Quick Refresher Section
• Quick Refresher - Lists, Tuples, & Algorithmic Time Complexity
  • Welcome to this Section
  • Section Handouts & Resources
  • What is an Algorithm?
  • Introduction to Lists (Lists 101)
  • Lists | Helpful Resources
  • Lists | Hands-on Practice
  • Lists | Test Your Knowledge
  • Introduction to Tuples (Tuples 101)
  • Tuples | Helpful Resources
  • Tuples | Hands-on Practice
  • Tuples | Test Your Knowledge
  • Slicing Lists and Tuples
  • Lists & Tuples | More Challenging Practice Exercises
  • Algorithmic Time Complexity 101
  • Meaning of c in Big O Notation
  • Time Complexity | Helpful Resources
  • Algorithmic Time Complexity | Test Your Knowledge
  • Recursion | Helpful Links
  • Lists, Tuples, & Algorithmic Time Complexity | Mini Project
  • Let's Dive Into These Algorithms!
• Linear Search - The Most Intuitive Search Algorithm
  • Introduction to Linear Search
  • Section Handout & Slides
  • Visual Walkthrough of Linear Search
  • Linear Search | Algorithm
  • Code Walkthrough of Linear Search
  • Linear Search | Code
  • Linear Search | Implementation & Code
  • Time Complexity of Linear Search
  • Step-By-Step Example
  • Implement Linear Search in Python
  • Section Quiz | Test Your Knowledge
  • Linear Search | Mini Project
• Binary Search - An Efficient Search Algorithm
  • Introduction to Binary Search
  • Section Handout & Slides
  • Visual Walkthrough of Binary Search
  • Binary Search | Algorithm
  • Code Walkthrough (Iterative)
  • Binary Search | Iterative Code
  • Overflow Bug Prevention for Huge Lists
  • Code Walkthrough (Recursive)
  • Binary Search | Recursive Code
  • Binary Search | Testing Larger Inputs (250,000 items!)
  • Binary Search | Implementation & Code
  • Time Complexity of Binary Search
  • First Step-By-Step Example
  • Second Step-By-Step Example
  • Implement Binary Search
  • Section Quiz | Test Your Knowledge
  • Binary Search | Mini Project
• Bubble Sort - Your First Sorting Algorithm
  • Introduction to Bubble Sort
  • Section Handout & Slides
  • Important Sorting Terminology
  • Visual Walkthrough of Bubble Sort
  • Bubble Sort | Algorithm
  • Code Walkthrough
  • Bubble Sort | Code (Basic Version)
  • Bubble Sort | Code (Optimized)
  • Bubble Sort | Implementation & Code
  • Time Complexity of Bubble Sort
  • First Step-By-Step Example
  • Second Step-By-Step Example
  • Implement Bubble Sort
  • Section Quiz | Test Your Knowledge
  • Bubble Sort | Mini Project
• Selection Sort - Optimizing the Process
  • Introduction to Selection Sort
  • Section Handout & Slides
  • Visual Walkthrough of Selection Sort
  • Selection Sort | Algorithm
  • Code Walkthrough
  • Selection Sort | Code
  • Selection Sort | Implementation and Code
  • Time Complexity of Selection Sort
  • First Step-By-Step Example | Visual
  • First Step-By-Step Example | Code
  • Working with Strings
  • Second Step-By-Step Example | Visual
  • Second Step-By-Step Example | Code
  • Implement Selection Sort
  • Section Quiz | Test Your Knowledge
  • Selection Sort | Mini Project
• Insertion Sort - Build the List One By One
  • Introduction to Insertion Sort
  • Section Handout & Slides
  • Visual Walkthrough of Insertion Sort
  • Insertion Sort | Algorithm
  • Code Walkthrough
  • Insertion Sort | Implementation & Code
  • Insertion Sort | Implementation (Tips & Tricks)
  • Nested Loops in Insertion Sort: Behind the Scenes
  • Insertion Sort | Code
  • Time Complexity of Insertion Sort
  • First Step-By-Step Example | Visual
  • First Step-By-Step Example | Code
  • Working with Strings
  • Second Step-By-Step Example | Visual
  • Second Step-By-Step Example | Code
  • Implement Insertion Sort
  • Section Quiz | Test Your Knowledge
  • Insertion Sort | Mini Project
• Merge Sort - Where True Efficiency Begins
  • Introduction to Merge Sort
  • Section Handout & Slides
  • Visual Walkthrough of Merge Sort
  • Merge Sort | Algorithm
  • Code Walkthrough Part 1| merge_sort()
  • Code Walkthrough Part 2 | merge()
  • Truthy and Falsy values in merge()
  • Code Walkthrough Part 3 | Output
  • Merge Sort | Implementation & Code
  • Why does it work?
  • Merge Sort | Code
  • Merge Sort for Large Lists | Practical Example
  • Time Complexity of Merge Sort
  • Step-By-Step Example | Visual
  • Step-By-Step Example | Code
  • Implement Merge Sort
  • Section Quiz | Test Your Knowledge
  • Merge Sort | Mini Project
• Quicksort - Time and Space Efficiency in One Algorithm
  • Introduction to Quicksort
  • Section Handout & Slides
  • Key Vocabulary: Partition
  • Key Vocabulary: Pivot
  • Visual Walkthrough of Quicksort
  • Quicksort | Algorithm
  • Code Walkthrough Part 1 | quicksort()
  • Why does it work? Key Tips
  • Code Walkthrough Part 2 | partition()
  • Quicksort | Implementation & Code
  • Can I use pivot instead of lst[high]?
  • Lomuto's vs. Hoare's Partition Schemes
  • Quicksort | Code
  • Quicksort for Large Lists | Practical Example
  • Time Complexity of Quicksort
  • Importance of Choosing the Right Pivot
  • Choosing the Pivot | Randomly
  • Choosing the Pivot | Median of Three
  • Step-By-Step Example | Visual
  • Step-By-Step Example | Code
  • Implement Quicksort
  • Section Quiz | Test Your Knowledge
  • Quicksort | Mini Project
• Use the timeit Module to Compare Efficiency
  • Introduction to the timeit module
  • Section Resources & Slides
  • The timeit Module
  • Testing Linear Search with timeit
  • Testing Binary Search with timeit
  • Linear Search vs. Binary Search with timeit
  • Let's Analyze Sorting Algorithms
  • Testing Bubble Sort with timeit
  • Selection Sort vs. Insertion Sort with timeit
  • Insertion Sort vs. Merge Sort vs. Quicksort with timeit
  • Experiment with timeit
  • Analyze the Time Efficiency of the Algorithms using timeit | Mini Project
• Course Wrap-Up: Congratulations
  • Congratulations!
  • Your Feedback is Greatly Appreciated
  • Download your Certificate of Completion