Divide and Conquer: Strategy and Classic Algorithms | Saleh | Nahid | Rayed | SWE-23 Algo

This is our group presentation on Divide and Conquer for the Algorithms course at Shahjalal University of Science and Technology (SUST), Software Engineering, session 2023–24. We explain the divide, conquer and combine strategy and the Master Theorem. Then we walk through three classic algorithms step by step on real examples: Merge Sort, Min-Max and Quick Sort. We also look at how each one performs and when to use it. Presented by: Saleh Sabit (2023831019): Divide and Conquer basics and Merge Sort Nahid Hasan (2023831040): Min-Max algorithm Rayed Bin Razzak (2023831047): Quick Sort, comparison and conclusion Made for our course instructor.