Merge Sort
Prerequisites of the Experiment
This experiment requires you to have basic knowledge about :
And above all, a curiosity to learn and explore..!
Overview of the Experiment
- The aim of this experiment is to understand the Merge Sort algorithm, its time and space complexity, and how it compares against other sorting algorithms.
- The experiment features a series of modules with video lectures, interactive demonstrations, simulations, hands-on practice exercises and quizzes to self analyze.
Experiment Modules and their Weightage
| Module | Weightage | Expectation |
|---|---|---|
| Pre-Test | 10% | Solve All Questions |
| Split | 20% | Practice how to recursively split arrays |
| Merge | 20% | Practice how to merge sorted arrays |
| Merge Sort | 30% | Practice the full algorithm |
| Post-test | 20% | Solve all Questions |