Algorithm - Mergesort & Quicksort
-
Upload
varendra-university-rajshahi-bangladesh -
Category
Education
-
view
72 -
download
2
Transcript of Algorithm - Mergesort & Quicksort
![Page 1: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/1.jpg)
WELCOME TO MY
PRESENTATION
![Page 2: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/2.jpg)
Course title : Algorithm - Mergesort & Quicksort CSE-225
• Submitted By: • Submitted ToName: Istiaque Ahmed
ShuvoId:141311057
5th batch ,5th semesterSec-BDept. Of CseVarendra University,rajshahi
Name: Atiquer Rahman Sarkar, CSE, Varendra University
![Page 3: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/3.jpg)
Quick sort Algorithm
![Page 4: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/4.jpg)
Merge sort Algorithm
Merge Sort
Merge sort is based on Divide and conquer method. It takes the list to be sorted and divide it in half to create two unsorted lists. The two unsorted lists are then sorted and merged to get a sorted list. The two unsorted lists are sorted by continually calling the merge-sort algorithm; we eventually get a list of size 1 which is already sorted. The two lists of size 1 are then merged.
Example sort Example
![Page 5: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/5.jpg)
The most well known algorithm design strategy:
1.Divide instance of problem into two or more smaller instances
2.Solve smaller instances recursively
3.Obtain solution to original (larger) instance by combining these solutions
![Page 6: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/6.jpg)
Divide-and-conquer Technique
subproblem 2 of size n/2
subproblem 1 of size n/2
a solution to subproblem 1
a solution tothe original problem
a solution to subproblem 2
a problem of size n
![Page 7: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/7.jpg)
Divide and Conquer Examples
• Sorting: mergesort and quicksort
• Tree traversals
• Matrix multiplication-Strassen’s algorithm
• Closest pair problem
![Page 8: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/8.jpg)
Merge Sort Algorithm
![Page 9: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/9.jpg)
MergeSort (Example) - 1
![Page 10: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/10.jpg)
MergeSort (Example) - 2
![Page 11: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/11.jpg)
MergeSort (Example) - 3
![Page 12: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/12.jpg)
MergeSort (Example) - 4
![Page 13: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/13.jpg)
MergeSort (Example) - 5
![Page 14: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/14.jpg)
MergeSort (Example) - 6
![Page 15: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/15.jpg)
MergeSort (Example) - 7
![Page 16: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/16.jpg)
MergeSort (Example) - 8
![Page 17: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/17.jpg)
MergeSort (Example) - 9
![Page 18: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/18.jpg)
MergeSort (Example) - 10
![Page 19: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/19.jpg)
MergeSort (Example) - 11
![Page 20: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/20.jpg)
MergeSort (Example) - 12
![Page 21: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/21.jpg)
MergeSort (Example) - 13
![Page 22: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/22.jpg)
MergeSort (Example) - 14
![Page 23: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/23.jpg)
MergeSort (Example) - 15
![Page 24: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/24.jpg)
MergeSort (Example) - 16
![Page 25: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/25.jpg)
MergeSort (Example) - 17
![Page 26: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/26.jpg)
MergeSort (Example) - 18
![Page 27: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/27.jpg)
MergeSort (Example) - 19
![Page 28: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/28.jpg)
MergeSort (Example) - 20
![Page 29: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/29.jpg)
MergeSort (Example) - 21
![Page 30: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/30.jpg)
MergeSort (Example) - 22
![Page 31: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/31.jpg)
14 23 45 98 6 33 42 67
![Page 32: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/32.jpg)
Merge
23 45 98 33 42 6714 6
![Page 33: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/33.jpg)
Merge
23 45 98 6 42 67
6
14 33
![Page 34: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/34.jpg)
Merge
14 45 98 6 42 67
6 14
23 33
![Page 35: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/35.jpg)
Merge
14 23 98 6 42 67
6 14 23
45 33
![Page 36: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/36.jpg)
Merge
14 23 98 6 33 67
6 14 23 33
45 42
![Page 37: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/37.jpg)
Merge
14 23 98 6 33 42
6 14 23 33 42
45 67
![Page 38: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/38.jpg)
Merge
14 23 45 6 33 42
6 14 23 33 42 45
98 67
![Page 39: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/39.jpg)
Merge
14 23 45 98 6 33 42 67
6 14 23 33 42 45 67
![Page 40: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/40.jpg)
Merge
14 23 45 98 6 33 42 67
6 14 23 33 42 45 67 98
![Page 41: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/41.jpg)
Quick sort Algorithm
![Page 42: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/42.jpg)
QUICKSORT (A, p, r)
1. if p < r2. q = PARTITION (A, p, r)3. QUICKSORT (A, p, q-1)4. QUICKSORT (A, q -1, r)
Partitioning the array
PARTITION (A, p, r)
1. X=A[r]2. i =p -13. for j = p to r -14. if A[j] X5. i = i + 16. exchange A[i] with A[j]7. exchange A[i+1] with A[r]8. return i+1
![Page 43: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/43.jpg)
![Page 44: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/44.jpg)
![Page 45: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/45.jpg)
![Page 46: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/46.jpg)
![Page 47: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/47.jpg)
![Page 48: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/48.jpg)
![Page 49: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/49.jpg)
![Page 50: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/50.jpg)
![Page 51: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/51.jpg)
![Page 52: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/52.jpg)
![Page 53: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/53.jpg)
![Page 54: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/54.jpg)
![Page 55: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/55.jpg)
![Page 56: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/56.jpg)
![Page 57: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/57.jpg)
![Page 58: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/58.jpg)
![Page 59: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/59.jpg)
![Page 60: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/60.jpg)
![Page 61: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/61.jpg)
![Page 62: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/62.jpg)
![Page 63: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/63.jpg)
![Page 64: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/64.jpg)
![Page 65: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/65.jpg)
![Page 66: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/66.jpg)
![Page 67: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/67.jpg)
![Page 68: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/68.jpg)
![Page 69: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/69.jpg)
![Page 70: Algorithm - Mergesort & Quicksort](https://reader035.fdocuments.net/reader035/viewer/2022081513/55d39c39bb61ebf2268b4690/html5/thumbnails/70.jpg)