Sorting & Searching

Learning Objectives

• Implement classic sorting algorithms like Merge Sort and Quick Sort.
• Execute Binary Search on a sorted collection.
• Compare the stability and in-place properties of different sorts.

Core Topics

Practical Exercise

Implement Merge Sort and Quick Sort, generate an array of 100,000 random integers, and benchmark the time each algorithm takes to sort the array.

Recommended Learning Resources