Sorting Quick Sort, Shell Sort, Counting Sort, Radix Sort AND Bucket Sort.
Merj sort
-
Upload
nauman-ali -
Category
Software
-
view
43 -
download
0
Transcript of Merj sort
![Page 1: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/1.jpg)
TOPIC :-
MERGE SORT
![Page 2: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/2.jpg)
B A S I C C O N C E P T O F M E R G E S O R T
I. Uses divide and conquer technique.
II. array is divided into sub-array.
III. Sub-arrays merged to get sorted result.
![Page 3: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/3.jpg)
DIVIDE AND CONQUER
Divide and conquer method for algorithm design:
• Divide: Large problem is divided into sub-problems
• Conquer: recursively solve the sub-problems
• Combine: • Take the solutions to the sub-problems• “merge” these solutions into final solution
3
![Page 4: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/4.jpg)
DRY RUN OF PROGRAM
4
![Page 5: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/5.jpg)
CONTD.
5
![Page 6: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/6.jpg)
CONTD.
6
![Page 7: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/7.jpg)
CONTD.
7
![Page 8: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/8.jpg)
CONTD.
8
![Page 9: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/9.jpg)
CONTD.
9
![Page 10: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/10.jpg)
CONTD.
10
![Page 11: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/11.jpg)
CONTD.
11
![Page 12: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/12.jpg)
CONTD.
12
![Page 13: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/13.jpg)
CONTD.
13
![Page 14: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/14.jpg)
CONTD.
14
![Page 15: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/15.jpg)
CONTD.
15
![Page 16: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/16.jpg)
CONTD.
16
![Page 17: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/17.jpg)
CONTD.
17
![Page 18: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/18.jpg)
CONTD.
18
![Page 19: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/19.jpg)
CONTD.
19
![Page 20: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/20.jpg)
CONTD.
20
![Page 21: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/21.jpg)
CONTD.
21
![Page 22: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/22.jpg)
CONTD.
22
![Page 23: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/23.jpg)
CONTD.
23
![Page 24: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/24.jpg)
CONTD.
24
![Page 25: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/25.jpg)
AT THE END SORTED
25
![Page 26: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/26.jpg)
MERGING FUNCTION void merge ( int , int , int ) ;
void merge _ sort(int low , int high)
{
int mid;
if(low<high)
{
mid=( low + high)/2 ;
merge _ sort ( low , mid) ;
merge _ sort(mid+1,high);
merge ( low , mid , high) ;
}
}
![Page 27: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/27.jpg)
IMPLEMENTATION
![Page 28: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/28.jpg)
SUMMARY OF SORTING ALGORITHMS
Algorithm Time Notes
selection-sort O(n2) in-place slow (good for small inputs)
insertion-sort O(n2) in-place slow (good for small inputs)
quick-sort O(n log n) expected
in-place, randomized fastest (good for large inputs)
merge-sort O (n log n) sequential data access fast (good for huge inputs)
![Page 29: Merj sort](https://reader033.fdocuments.in/reader033/viewer/2022060112/556d0c2dd8b42ad34f8b4d19/html5/thumbnails/29.jpg)
ANY QUESTION…