Merge sort data structures
Download as PPT, PDF0 likes56 views
Merge Sort follows the divide and conquer approach to sort a list by recursively dividing it into smaller sub-lists, sorting those sub-lists using the same approach, and then merging the sorted sub-lists back together; it runs in O(n log n) time by breaking the problem into smaller problems of sorting each half of the list, combining the solutions by merging the halves back together; the document provides an overview of the merge sort algorithm and its use of divide and conquer to break down a sorting problem into subproblems.
1 of 8
Download to read offline
![Algorithm
MergeSort(arr[], l, r)
If r > l
1. Find the middle point to divide the array into two
halves:
middle m = (l+r)/2
2. Call mergeSort for first half:
Call mergeSort(arr, l, m)
3. Call mergeSort for second half:
Call mergeSort(arr, m+1, r)
4. Merge the two halves sorted in step 2 and 3:
Call merge(arr, l, m, r)](https://image.slidesharecdn.com/mergesortdatastructures-200520053745/85/Merge-sort-data-structures-6-320.jpg)
More Related Content
What's hot (20)
Ad
Similar to Merge sort data structures (20)
Ad
More from chauhankapil (20)
Merge sort data structures
- 1. Merge Sort in Data Structures Prof. Neeraj Bhargava Kapil Chauhan Department of Computer Science School of Engineering & Systems Sciences MDS University, Ajmer
- 2. Introduction Merge Sort follows the rule of Divide and Conquer to sort a given set of numbers/elements, recursively, hence consuming less time. Merge sort , runs in O(n*log n) time in all the cases.
- 3. Divide and Conquer If we can break a single big problem into smaller sub- problems, solve the smaller sub-problems and combine their solutions to find the solution for the original big problem, it becomes easier to solve the whole problem. The concept of Divide and Conquer involves three steps: Divide the problem into multiple small problems.
- 4. Cont.. Conquer the subproblems by solving them. The idea is to break down the problem into atomic subproblems, where they are actually solved. Combine the solutions of the subproblems to find the solution of the actual problem.
- 6. Algorithm MergeSort(arr[], l, r) If r > l 1. Find the middle point to divide the array into two halves: middle m = (l+r)/2 2. Call mergeSort for first half: Call mergeSort(arr, l, m) 3. Call mergeSort for second half: Call mergeSort(arr, m+1, r) 4. Merge the two halves sorted in step 2 and 3: Call merge(arr, l, m, r)
- 7. Example
- 8. Assignment Explain Merge Sort in data structure with suitable example and discuss basic operation.