This course provides fundamental and advanced insights into sorting and searching algorithms. It walks through various algorithm types and functionalities, complexity analysis, and practical applications in complex problem-solving.
Overview
Syllabus
- Unit 1: Understanding Recursion in Programming with Kotlin
- Counting Digits in Ancient Numbers
- Counting Even Digits Recursively in Kotlin
- Counting Cosmic Digits
- Sum of Digits Using Recursion
- Unit 2: Understanding Binary Search in Kotlin
- Binary Search for Book ID in Kotlin
- Binary Search Insert Position Adjustment
- Binary Search Repair Task
- Binary Search for a Book in Kotlin
- Binary Search for Book ID in Kotlin
- Iterative Binary Search Implementation
- Unit 3: Advanced Binary Search Techniques in Kotlin
- Find Position in a Bitonic Sequence
- Find the Largest Element in a Cyclically Sorted Array
- Unit 4: Understanding Quick Sort Algorithm with Kotlin
- Partitioning Space Rocks by Mass
- Finding the Pivot Position in a Galaxy of Numbers
- Quick Sort to Organize Space Rock Sizes
- Implement Quick Sort in Kotlin
- Unit 5: Merge Sort with Kotlin
- Merge Sort in Kotlin
- Stellar Navigator Playlist Sorting Fix
- Merge Sort Merging Process
- Implementing the Merge Sort Function in Kotlin
- Unit 6: Using Kotlin's Built-in Sorting Functions for Efficient Data Management
- Sorting Inventory Quantities
- Sort Grocery Inventory Alphabetically
- Sort Grocery Store Inventory by Price
- Sorting Products by Descending Price in Kotlin
- Sort the Grocery Inventory by Price and Rating
- Unit 7: Advanced Sorting Applications in Kotlin
- Finding the K-th Highest Score in an Array
- Counting Inversions in an Array