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: Exploring Recursion in C++
- Counting Even Digits with Recursion in C++
- Identifying and Fixing Recursive Digit Count Bug
- Sum of Digits Using Recursion in C++
- Unit 2: Introduction to Binary Search in C++
- Modifying Binary Search to Return Insertion Index
- Fixing Infinite Recursion in C++ Binary Search
- Implementing Binary Search in C++
- Implementing Iterative Binary Search in C++
- Unit 3: Introduction to Advanced Binary Search Problems in C++
- Searching a Number in a Bitonic Array
- Finding Maximum in a Cyclically Sorted Array
- Unit 4: Exploring Sorting Techniques in C++
- Sorting Grocery Inventory Alphabetically
- Sorting Books by Ascending Price
- Sorting Players using Custom Logic in C++
- Unit 5: Exploring Quick Sort in C++
- Quick Sort Partition Implementation in C++
- Sorting Space Rocks with Quick Sort Algorithm in C++
- Implementing the Partition Function in Quick Sort
- Unit 6: Exploring Merge Sort in C++
- Fix the Merge Process in Merge Sort
- Enhance the Merge Process in Merge Sort C++ Task
- Complete MergeSort Function in C++
- Unit 7: Advanced Applications of Sorting Algorithms in C++
- Identify K-th Rarest Artifact Score in C++
- Count Inversions in an Array using Merge Sort
Related Courses
Related Articles
-
13 Best Data Structures & Algorithms Courses for 2026
-
[2026] Unlock 2000+ Free Certificates: Master Tech & Soft Skills with CodeSignal Learn
-
Become a Supercommunicator: Practical Skills for Better Conversations
-
CodeSignal – The Duolingo of Coding Practice
-
11 Best C++ Courses for 2026: A Lang for the Modern Age
-
[2026] 140+ Universities Just Launched 900+ Online Courses. Here’s the Full List.
