Merge Sort - Ms Lavanya G

In this video, following subtopics have been covered:

Introduction about Merge sort algorithm that follows the Divide and Conquer approach. Then explaining about how algorithm works in merge sort with example. Here are the steps of the Merge Sort algorithm:

1. Divide the given unsorted array with n elements into n subarrays, each having one element.
2. Merge these subarrays repeatedly, to produce new sorted subarrays.
3. Combine the individually sorted subarrays into larger arrays until the whole array is merged

#sist #sathyabama #mergesort #sortingalgorithms #daa #algorithms #datastructure

Видео Merge Sort - Ms Lavanya G канала Sathyabama Institute of Science and Technology