smooth sort
DESCRIPTION
TRANSCRIPT
![Page 1: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/1.jpg)
Analysis of Algorithm
SmoothSort
Habib Ullah MS(CS)
![Page 2: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/2.jpg)
Science of Computer ProgrammingVolume 1, Issue 3, Pages 223–233
Smoothsort, an alternative for sorting in situ
(Edsger Wybe)
http://www.sciencedirect.com/science/article/pii/0167642382900168
![Page 3: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/3.jpg)
Contents
• What is Smoothsort• Heapsort Analysis• Idea: A family of heaps• Leonardo Numbers & Trees• Smoothsort operations• Algo & Runtime Analysis• Conclusion
![Page 4: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/4.jpg)
Waybe
![Page 5: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/5.jpg)
![Page 6: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/6.jpg)
Why is Heapsort O(n lg n)?
![Page 7: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/7.jpg)
Why is Heapsort O(n lg n)?
![Page 8: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/8.jpg)
Why is Heapsort O(n lg n)?
![Page 9: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/9.jpg)
Why is Heapsort O(n lg n)?
![Page 10: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/10.jpg)
![Page 11: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/11.jpg)
![Page 12: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/12.jpg)
![Page 13: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/13.jpg)
![Page 14: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/14.jpg)
Building a Leonardo Heap
Insert Operation
![Page 15: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/15.jpg)
Insert Operation
![Page 16: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/16.jpg)
![Page 17: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/17.jpg)
![Page 18: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/18.jpg)
![Page 19: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/19.jpg)
![Page 20: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/20.jpg)
![Page 21: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/21.jpg)
![Page 22: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/22.jpg)
![Page 23: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/23.jpg)
![Page 24: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/24.jpg)
![Page 25: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/25.jpg)
![Page 26: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/26.jpg)
![Page 27: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/27.jpg)
![Page 28: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/28.jpg)
![Page 29: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/29.jpg)
![Page 30: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/30.jpg)
![Page 31: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/31.jpg)
![Page 32: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/32.jpg)
![Page 33: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/33.jpg)
![Page 34: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/34.jpg)
![Page 35: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/35.jpg)
![Page 36: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/36.jpg)
![Page 37: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/37.jpg)
![Page 38: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/38.jpg)
![Page 39: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/39.jpg)
![Page 40: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/40.jpg)
![Page 41: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/41.jpg)
![Page 42: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/42.jpg)
![Page 43: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/43.jpg)
![Page 44: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/44.jpg)
![Page 45: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/45.jpg)
DE queuing from a Leonardo Heap
Remove Operation
![Page 46: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/46.jpg)
Dequeue Operation
![Page 47: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/47.jpg)
![Page 48: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/48.jpg)
![Page 49: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/49.jpg)
![Page 50: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/50.jpg)
![Page 51: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/51.jpg)
![Page 52: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/52.jpg)
![Page 53: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/53.jpg)
![Page 54: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/54.jpg)
![Page 55: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/55.jpg)
![Page 56: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/56.jpg)
![Page 57: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/57.jpg)
![Page 58: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/58.jpg)
![Page 59: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/59.jpg)
![Page 60: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/60.jpg)
![Page 61: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/61.jpg)
![Page 62: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/62.jpg)
![Page 63: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/63.jpg)
![Page 64: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/64.jpg)
![Page 65: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/65.jpg)
![Page 66: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/66.jpg)
![Page 67: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/67.jpg)
![Page 68: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/68.jpg)
![Page 69: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/69.jpg)
![Page 70: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/70.jpg)
![Page 71: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/71.jpg)
![Page 72: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/72.jpg)
![Page 73: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/73.jpg)
![Page 74: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/74.jpg)
![Page 75: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/75.jpg)
![Page 76: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/76.jpg)
![Page 77: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/77.jpg)
![Page 78: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/78.jpg)
![Page 79: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/79.jpg)
![Page 80: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/80.jpg)
![Page 81: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/81.jpg)
![Page 82: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/82.jpg)
Algo & Runtime Analysis
![Page 83: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/83.jpg)
• Insert
– If last two heaps are two consecutive leonardo numbers• Add new element as there root
– Else if the rightmost is not of size 1• New element becomes a new heap of size 1. This 1 is taken to be
L(1)– Else
• New element becomes a new heap of size 1. This 1 is taken to be L(0)
• Restore
– Set new element as "current" heap.
– While there is a heap to the left of the current heap and its root is larger than the current root and both of its child heap roots
• Swap(left-root with current).[Now current is that left root]
– While the current heap has a size greater than 1 and either child heap of the current heap has a root node greater than the root of the current heap
• Swap the greater child root with the current root. That child heap becomes the current heap.
C1
(Log N) times (Log N)
Log N
![Page 84: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/84.jpg)
Dequeue
– Remove topmost node of rightmost heap.– If it has no children, we're done.
– Otherwise:
– Fix up the left of the two heaps.– Then fix up the right of the two heaps.
For N elements to dequeue running time is (N LogN) but this is asymptotically far less than Heap sort.
C1
Log N
![Page 85: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/85.jpg)
![Page 86: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/86.jpg)
![Page 87: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/87.jpg)
![Page 88: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/88.jpg)
![Page 89: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/89.jpg)
![Page 90: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/90.jpg)
![Page 91: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/91.jpg)
![Page 92: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/92.jpg)
![Page 93: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/93.jpg)
![Page 94: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/94.jpg)
![Page 95: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/95.jpg)
![Page 96: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/96.jpg)
![Page 97: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/97.jpg)
![Page 98: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/98.jpg)
![Page 99: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/99.jpg)
![Page 100: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/100.jpg)
![Page 101: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/101.jpg)
![Page 102: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/102.jpg)
![Page 103: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/103.jpg)
![Page 104: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/104.jpg)
![Page 105: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/105.jpg)
![Page 106: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/106.jpg)
![Page 107: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/107.jpg)
![Page 108: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/108.jpg)
![Page 109: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/109.jpg)
![Page 110: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/110.jpg)
![Page 111: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/111.jpg)
Conclusion
• Compared to Heap Sort– Efficient in Best Case– Equal in Worst Case but the asymptotic graph is
far less than Heap Sort
![Page 112: Smooth Sort](https://reader033.vdocuments.us/reader033/viewer/2022061218/54b6f00e4a795914568b45dd/html5/thumbnails/112.jpg)