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: Understanding Recursion in Ruby
- Counting Even Digits Recursively in Ruby
- Planetary Digit Tally Correction Task
- Sum of Digits Using Recursion in Ruby
- Unit 2: Introduction to Binary Search in Ruby
- Binary Search with Insertion Index
- Binary Search Algorithm: Fixing Infinite Recursion
- Binary Search Challenge
- Iterative Binary Search Algorithm Task
- Unit 3: Advanced Binary Search Techniques in Ruby
- Finding an Index in a Bitonic Array
- Finding the Maximum in a Cyclically Sorted Array
- Unit 4: Sorting Techniques in Ruby
- Sorting Grocery Items in Ruby
- Sort Movies by Rating in Descending Order
- Sorting Players by Score and Age
- Unit 5: Quick Sort in Ruby
- Partition Function with Pivot in Quick Sort
- Quick Sort Algorithm Implementation
- Completing the Partition Method for Quick Sort
- Unit 6: Merge Sort in Ruby
- Merge Sort Bug Fix Task
- Enhancing the Merge Process in Merge Sort
- Merge Sort Implementation Task
- Unit 7: Advanced Sorting Algorithms and Applications in Ruby
- Finding the K-th Rarest Artifact Score
- Count Inversions in an Array