Overview
This course teaches how to implement Merge Sort using recursion. The learning outcomes include understanding the concept of recursion, mastering the Merge Sort algorithm, analyzing space complexity, and exploring real-world applications of Merge Sort. The course covers topics such as the introduction to Merge Sort, its approach, writing the code, solving problems on platforms, improving the algorithm, and assigning homework for practice. The intended audience for this course is individuals interested in mastering recursive algorithms and improving their problem-solving skills in programming.
Syllabus
- Introduction
- Merge Sort
- Promotion
- Approach
- Code
- Solving on platform
- Slight improvement
- Space Complexity
- Applications
- Homework
Taught by
CodeHelp - by Babbar