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
- Unit 1: Exploring Recursion with PHP
- Counting Digits of a Number in PHP
- Refining the Digit Counter to Count Even Digits in PHP
- Counting Cosmic Digits Challenge
- Sum of Digits Using Recursion in PHP
- Unit 2: Binary Search with PHP
- Binary Search in a Virtual Book Library
- Binary Search Insert Position Adjustment
- Galactic Binary Search Repair Task
- Implement Binary Search to Find a Book in a Library
- Iterative Binary Search in PHP to Find Book ID Position
- Binary Search Implementation in PHP
- Unit 3: Advanced Binary Search Techniques with PHP
- Finding an Element in a Bitonic Sequence
- Finding the Largest Element in a Cyclically Sorted Array
- Unit 4: Exploring Quick Sort Algorithm with PHP
- Partitioning Space Rocks by Mass in PHP
- Partitioning a Galaxy of Numbers in PHP
- Quick Sort Algorithm for Space Rock Sizes
- Implement Quick Sort in PHP
- Unit 5: Exploring Merge Sort with PHP
- Merge Sort Algorithm Practice
- Stellar Playlist Sorting Bug Fix
- Merge Sort Array Merging Task
- Merge Sort Harmony: Completing the Musical Playlist
- Unit 6: Exploring Sorting Techniques with PHP
- Sorting Stock Quantities in PHP
- Sorting the Grocery Inventory Alphabetically
- Sort Grocery Store Inventory by Price
- Sort Products by Descending Price in PHP
- Sort Grocery Inventory by Price and Rating
- Unit 7: Mastering Advanced Sorting Applications with PHP
- Find the K-th Highest Score in Scores Array
- Counting Inversions in an Array