Merge Sort

Prerequisites of the Experiment

This experiment requires you to have basic knowledge about :

• The Notion of Sorting
• Concept of Binary tree
• Basics of Logarithm

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