Analysis and Design of Algorithms

Online MCA · Sem 1 · MCA133

MCA133Lesson 4 of 18

Divide and Conquer: Merge Sort, Quick Sort and Strassen's Matrix Multiplication

Analysis and Design of Algorithms

About the video

L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer

Gate Smashers

What you’ll learn

Module II, Sorting and searching Order statistics: Divide & Conquer Strategy, Quick Sort, merge sort, Strassen's Matrix Multiplication

Contribute

Make this lesson better

The team reads every rating and fixes the lessons that need it most first.