Mark Distribution: You will be marked on three categories:

Implementation $-20$ marks

Experimental analysis $-20$ marks

Discussion $-10$ marks

Objective: To analyze, implement, and compare the efficiency of various sorting algorithms in

real$-$world scenarios.

Introduction: Sorting is a fundamental operation in computer science, with numerous applications

in various domains. In this assignment, you will explore the performance of different sorting

algorithms: Insertion Sort, Merge Sort, Heapsort, and Quicksort. You will analyze their time

complexity, space complexity, and suitability for different scenarios.

Scenario: You are hired as a software engineer at a logistics company that needs to optimize its

package sorting system. The company receives thousands of packages daily, each with different

weights, sizes, and delivery destinations. Your task is to design and implement an efficient sorting

algorithm to streamline the package sorting process.