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 C#
- Selective Digit Counter Using Recursion
- Planetary Digit Count Fix
- Calculate Sum of Digits Using Recursion
- Unit 2: Introduction to Binary Search in C#
- Binary Search Insertion Index Task
- Fix the Infinite Recursion in Binary Search
- Binary Search Completion Task
- Implementing Iterative Binary Search in C#
- Unit 3: Advanced Binary Search Techniques in C#
- Finding an Element in a Bitonic Array
- Cyclically Sorted Array Treasure Hunt
- Unit 4: Sorting Techniques in C#: Harnessing Built-in Methods and Custom Logic
- Sorting the Grocery Inventory Alphabetically
- Sorting Movies by Rating in Descending Order
- Sorting Players by Score and Age
- Unit 5: Introduction to Quick Sort in C#
- Pivot Star Placement in Quick Sort
- Quick Sort: Organizing Space Rock Sizes
- Implement Quick Sort Recursive Calls
- Unit 6: Understanding Merge Sort in C#
- Fixing the Merge Sort in C#
- Merge Sort: Completing the Merging Process
- Complete the MergeSort Function
- Unit 7: Advanced Applications of Sorting Algorithms in C#
- Find the K-th Rarest Artifact in an Array
- Count Inversions in an Array Using Merge Sort