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
- Unit 1: Understanding Recursion in TypeScript
- Counting Digits Recursively in TypeScript
- Understanding Recursion with Cake Layers
- Fixing the Factorial Function in TypeScript
- Calculating Sum of Digits Recursively in TypeScript
- Unit 2: Binary Search in TypeScript
- Implementing Recursive Binary Search in TypeScript
- Binary Search for Book Index in TypeScript
- Binary Search for Book ID in TypeScript
- Implement Binary Search for Book Lookup in TypeScript
- Unit 3: Introduction to Advanced Binary Search Problems in TypeScript
- Searching in a Bitonic Array Using TypeScript
- Finding the Minimum in a Rotated Sorted Array
- Unit 4: Quick Sort Algorithm Implementation in TypeScript
- Partitioning with Quick Sort in TypeScript
- Partition Function Implementation in TypeScript
- Sorting Toy Cars with Quick Sort Algorithm in TypeScript
- Implementing Quick Sort in TypeScript
- Unit 5: Introduction to Merge Sort in TypeScript
- Efficient Card Sorting with Merge Sort in TypeScript
- Fix the TypeScript Merge Sort Implementation
- Merge Sort in TypeScript: Completing the Merge Function
- Understanding and Completing the Merge Sort Function in TypeScript
- Unit 6: Sorting Arrays With Built-In TypeScript Functions
- Alphabetically Sorting Product Names in TypeScript
- Sorting Products by Price in TypeScript
- Alphabetical Sorting in TypeScript
- Sorting Online Store Products with TypeScript
- Unit 7: TypeScript Adventures in Sorting Algorithms: Quick Sort and Merge Sort Applications
- Finding the K-th Highest Price at the Galactic Auction
- Counting Topsy-Turvy Pairs in an Array