This comprehensive course is specially designed to impart a fundamental and advanced understanding of sorting and searching algorithms. The course will guide you through different types and functionalities of these algorithms, their complexity analysis, and practical application in resolving complex programming problems.
Overview
Syllabus
- Lesson 1: Exploring the Magic of Recursion in JavaScript
- Count the Layers of the Cake
- Add Recursive Call Logging to the Cake Layer Counter Function
- Digit Counter Debugging Challenge
- Add a Recursive Cake Candle Counter Function
- Lesson 2: Binary Search in JavaScript: Unraveling the Algorithm and Complexity
- Library Database Book Locator
- Adjust Book Search to Return Index Instead of Boolean
- Add Binary Search for Book ID
- Library Book Finder with Iterative Binary Search
- Add Binary Search Functionality to the Library System
- Lesson 3: Advanced Binary Search: Mastering Complex Array Problems
- Bitonic Sequence Number Locator
- Locating the Largest Coordinate in a Scrambled Array
- Lesson 4: Sorting Data Swiftly: Quick Sort in JavaScript Explained
- Organizing Toy Cars with Quick Sort Partition
- Organize the Toy Car Collection
- Quick Sort Toy Car Array Challenge
- Adding the Missing Quick Sort Function
- Lesson 5: Merge Sort Mastery: Sorting Arrays Efficiently in JavaScript
- Sorting Cards with Merge Sort in JavaScript
- Repair the Merge Sort Function
- Implement the Merge Function in Merge Sort Algorithm
- Merge Sorting with Direct Integration in JavaScript
- Lesson 6: Mastering the Sort Function: Organizing Data in JavaScript
- Alphabetize Product Names in the Online Store
- Sort Products by Price in Online Store
- Sort Products by Name in Ascending Order
- Sort Products by Category and Price in JavaScript
- Lesson 7: Advanced Techniques with Sorting Algorithms: K-th Largest Element and Inversion Count
- Galactic Auction: Finding the K-th Highest Bid using Quick Sort Algorithm
- Counting Topsy-Turvy Pairs in an Array
