This course provides fundamental and advanced insights into sorting and searching algorithms. It walks through various algorithms' types and functionalities, complexity analysis, and practical applications in complex problem-solving.
Overview
Syllabus
- Unit 1: Recursion in Scala: An Introduction
- Count Even Digits Recursively in Scala
- Correcting the Recursive Digit Counter in Scala
- Recursive Digit Sum in Scala
- Unit 2: Binary Search in Scala: An Introduction
- Binary Search with Insertion Index Adjustment
- Fix the Infinite Recursion in Scala's Binary Search
- Complete the Recursive Binary Search in Scala
- Iterative Binary Search in Scala Task
- Unit 3: Advanced Techniques in Binary Search with Scala
- Searching in a Bitonic Array in Scala
- Finding the Maximum in a Cyclically Sorted Array
- Unit 4: Sorting Techniques in Scala: An Introduction
- Sorting a List of Grocery Items in Scala
- Sort Movies by Descending Rating in Scala
- Sort Players by Score and Age in Scala
- Unit 5: Quick Sort in Scala: A Comprehensive Guide
- Partition Elements Around Pivot in Scala
- Quick Sort Implementation in Scala
- Completing the Partition Function in Quick Sort
- Unit 6: Merge Sort in Scala: A Comprehensive Guide
- Fixing the Merge Sort Bug in Scala
- Enhancing the Merge Process in Scala Merge Sort
- Completing the Merge Sort Function in Scala
- Unit 7: Advanced Applications of Sorting Algorithms in Scala
- Identifying the K-th Rarest Artifact in Scala
- Counting Inversions in an Array Using Merge Sort