This is a comprehensive course curated to convey fundamental and advanced understanding of sorting and searching algorithms. The course guides through different types and functionality of these algorithms, their complexity analysis, and the practical application in solving complex programming problems.
Overview
Syllabus
- Lesson 1: Recursion Refreshment in Java
- Counting Digits in Cosmic Numbers
- Counting Even Digits with Recursion
- Cosmic Digit Counter Anomaly
- Cosmic Recursion: Summing the Stars
- Lesson 2: Exploring Binary Search: From Concept to Java Implementation and Complexity Analysis
- Binary Search: Locating a Book in the Library Catalog
- Binary Search Insertion Index
- Binary Search Anomaly in the Library Database
- Locating a Book with Binary Search
- Library Catalog: Find a Book with Binary Search
- Adding the Middle Index Calculation in Binary Search
- Lesson 3: Advanced Binary Search Techniques for Complex Data Structures
- Bitonic Sequence Number Locator
- Cyclically Sorted Array Exploration
- Lesson 4: Sorting with Quick Sort: Understanding the Algorithm and Its Java Implementation
- Organizing Space Rocks: Quick Sort Pivot Practice
- Celestial Quick Sort: Implement the Sorting Logic
- Sorting Space Rocks with QuickSort
- Implementing the Quick Sort Algorithm
- Lesson 5: Demystifying Merge Sort: Implementation and Complexity Analysis in Java
- Merging Playlists with Merge Sort Algorithm
- Unsorted Symphony: Debugging the Playlist Merge Function
- Merge the Musical Beats
- Harmonizing the Playlist with Merge Sort
- Lesson 6: Mastering Java's Built-in Sorting Functions: Arrays and Collections
- Sorting Grocery Stock Quantities
- Sort the Grocery Inventory
- Sorting Grocery Store Inventory by Price
- Ascending Order Inventory Sort
- Grocery Store Sorter: Order by Price and Name
- Lesson 7: Advanced Sorting Techniques: K-th Ordinal Statistics and Counting Inversions
- Discovering the K-th Highest Score in Space Olympics
- Counting Inversions in an Array of Integers
