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
- Lesson 2: Exploring Binary Search: From Concept to Java Implementation and Complexity Analysis
- Lesson 3: Advanced Binary Search Techniques for Complex Data Structures
- Lesson 4: Sorting with Quick Sort: Understanding the Algorithm and Its Java Implementation
- Lesson 5: Demystifying Merge Sort: Implementation and Complexity Analysis in Java
- Lesson 6: Mastering Java's Built-in Sorting Functions: Arrays and Collections
- Lesson 7: Advanced Sorting Techniques: K-th Ordinal Statistics and Counting Inversions
