Sorting and Searching Algorithms in Java
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.
Lessons and practices
Counting Digits in Cosmic Numbers
Counting Even Digits with Recursion
Cosmic Digit Counter Anomaly
Cosmic Recursion: Summing the Stars
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
Bitonic Sequence Number Locator
Cyclically Sorted Array Exploration
Organizing Space Rocks: Quick Sort Pivot Practice
Celestial Quick Sort: Implement the Sorting Logic
Sorting Space Rocks with QuickSort
Implementing the Quick Sort Algorithm
Merging Playlists with Merge Sort Algorithm
Unsorted Symphony: Debugging the Playlist Merge Function
Merge the Musical Beats
Harmonizing the Playlist with Merge Sort
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
Discovering the K-th Highest Score in Space Olympics
Counting Inversions in an Array of Integers
Interested in this course? Learn and practice with Cosmo!
Practice is how you turn knowledge into actual skills.