Upgrade to Pro — share decks privately, control downloads, hide ads and more …

Quick Sort

Avatar for KuoE0 KuoE0
March 15, 2013
Programming
5
10k

Quick Sort

Avatar for KuoE0

KuoE0

March 15, 2013
Tweet

More Decks by KuoE0

See All by KuoE0
Protocol handler in Gecko
Avatar for KuoE0 kuoe0
0
100
面試面試面試，因為很重要所以要說三次！
Avatar for KuoE0 kuoe0
2
270
應徵軟體工程師
Avatar for KuoE0 kuoe0
0
180
面試心得分享
Avatar for KuoE0 kuoe0
0
430
Windows 真的不好用...
Avatar for KuoE0 kuoe0
0
310
Python @Wheel Lab
Avatar for KuoE0 kuoe0
0
230
Introduction to VP8
Avatar for KuoE0 kuoe0
0
270
Python @NCKU_CSIE
Avatar for KuoE0 kuoe0
0
130
[ACM-ICPC] Tree Isomorphism
Avatar for KuoE0 kuoe0
1
260

Other Decks in Programming

See All in Programming
AI & Enginnering
Avatar for codelynx codelynx
0
110
副作用をどこに置くか問題：オブジェクト指向で整理する設計判断ツリー
Avatar for Koya Masuda koxya
1
590
360° Signals in Angular: Signal Forms with SignalStore & Resources @ngLondon 01/2026
Avatar for Manfred Steyer manfredsteyer
PRO
0
120
16年目のピクシブ百科事典を支える最新の技術基盤 / The Modern Tech Stack Powering Pixiv Encyclopedia in its 16th Year
Avatar for ahu ahuglajbclajep
5
990
AI前提で考えるiOSアプリのモダナイズ設計
Avatar for 野瀬田　裕樹 yuukiw00w
0
220
Spinner 軸ズレ現象を調べたらレンダリング深淵に飲まれた #レバテックMeetup
Avatar for 弁護士ドットコム bengo4com
1
230
Basic Architectures
Avatar for Denys Poltorak denyspoltorak
0
660
AIエージェント、”どう作るか”で差は出るか？ / AI Agents: Does the "How" Make a Difference?
Avatar for r-kagaya rkaga
4
2k
Kotlin Multiplatform Meetup - Compose Multiplatform 외부 의존성 아키텍처 설계부터 운영까지
Avatar for Suhyeon Kim wisemuji
0
190
Fragmented Architectures
Avatar for Denys Poltorak denyspoltorak
0
150
AI時代の認知負荷との向き合い方
Avatar for OptFit Corp. optfit
0
150
例外処理とどう使い分ける？Result型を使ったエラー設計 #burikaigi
Avatar for Takuma Kajikawa kajitack
16
6k

Featured

See All Featured
GitHub's CSS Performance
Avatar for Jon Rohan jonrohan
1032
470k
Digital Projects Gone Horribly Wrong (And the UX Pros Who Still Save the Day) - Dean Schuster
Avatar for UX Y'all uxyall
0
310
Impact Scores and Hybrid Strategies: The future of link building
Avatar for Tamara Novitovic tamaranovitovic
0
200
The #1 spot is gone: here's how to win anyway
Avatar for Tamara Novitovic tamaranovitovic
2
930
How to optimise 3,500 product descriptions for ecommerce in one day using ChatGPT
Avatar for Katarina Dahlin katarinadahlin
PRO
0
3.4k
Connecting the Dots Between Site Speed, User Experience & Your Business [WebExpo 2025]
Avatar for Tammy Everts tammyeverts
11
820
I Don’t Have Time: Getting Over the Fear to Launch Your Podcast
Avatar for Joe Casabona jcasabona
34
2.6k
How to Ace a Technical Interview
Avatar for Jacob Kaplan-Moss jacobian
281
24k
The Art of Programming - Codeland 2020
Avatar for Erika Heidi erikaheidi
57
14k
A Modern Web Designer's Workflow
Avatar for Chris Coyier chriscoyier
698
190k
How to build a perfect <img>
Avatar for Jono Alderson jonoalderson
1
4.9k
Being A Developer After 40
Avatar for Adrian Kosmaczewski akosma
91
590k

Transcript

  1. Quick Sort ֲࢸݢʢKuoE0ʣ [email protected] KuoE0.ch

  2. Latest update: Mar 15, 2013 Attribution-ShareAlike 3.0 Unported (CC BY-SA

    3.0) http://creativecommons.org/licenses/by-sa/3.0/

  3. Algorithm ࠾༻ divide & conquer ࡦུ

  4. Divide ኺᏐྻத௅ग़Ұݸݩૉ࡞ҝ pivotɼར ༻ pivot ሡݪᏐྻ෼ҝၷݸࢠᏐྻɿ • ॴ༗ݩૉখԙ pivot తᏐྻ

    A • ॴ༗ݩૉେԙ pivot తݩૉతᏐྻ B • ౳ԙ pivot తݩૉՄ์ஔࡏ೚Ұݸத

  5. 2 9 4 3 8 7 5 1 6

  6. 2 9 4 3 8 7 5 1 6 2

    7 4 3 5 1 6 9 8

  7. 9 8 2 4 3 5 1 6 2 9

    4 3 8 7 5 1 6 2 7 4 3 5 1 6 9 8

  8. 9 8 2 4 3 5 1 6 2 4

    5 1 6 2 9 4 3 8 7 5 1 6 2 7 4 3 5 1 6 9 8 3

  9. 4 5 6 2 1 9 8 2 4 3

    5 1 6 2 4 5 1 6 2 9 4 3 8 7 5 1 6 2 7 4 3 5 1 6 9 8 3

  10. 4 5 6 2 1 2 9 8 2 4

    3 5 1 6 2 4 5 1 6 2 9 4 3 8 7 5 1 6 2 7 4 3 5 1 6 9 8 3 1

  11. 4 5 6 2 1 2 9 8 2 4

    3 5 1 6 2 4 5 1 6 2 9 4 3 8 7 5 1 6 2 2 7 4 3 5 1 6 9 8 3 1

  12. 4 5 6 5 6 2 1 2 9 8

    2 4 3 5 1 6 2 4 5 1 6 2 9 4 3 8 7 5 1 6 2 2 7 4 3 5 1 6 9 8 3 1 4

  13. 5 6 4 5 6 5 6 2 1 2

    9 8 2 4 3 5 1 6 2 4 5 1 6 2 9 4 3 8 7 5 1 6 2 2 7 4 3 5 1 6 9 8 3 1 4

  14. 5 6 5 4 5 6 5 6 2 1

    2 9 8 2 4 3 5 1 6 2 4 5 1 6 2 9 4 3 8 7 5 1 6 2 2 7 4 3 5 1 6 9 8 3 1 4 6

  15. 5 6 5 4 5 6 5 6 2 1

    2 9 8 2 4 3 5 1 6 2 4 5 1 6 2 9 4 3 8 7 5 1 6 2 5 2 7 4 3 5 1 6 9 8 3 1 4 6

  16. 5 6 5 4 5 6 5 6 2 1

    2 9 8 9 2 4 3 5 1 6 2 4 5 1 6 2 9 4 3 8 7 5 1 6 2 5 2 7 4 3 5 1 6 9 8 3 1 4 6 8

  17. 5 6 5 4 5 6 5 6 2 1

    2 9 8 9 2 4 3 5 1 6 2 4 5 1 6 2 9 4 3 8 7 5 1 6 9 2 5 2 7 4 3 5 1 6 9 8 3 1 4 6 8

  18. Conquer ༝ԙࢠᏐྻቮඃ pivot ෼ҝၷஈɼҰஈ খԙ౳ԙ pivot తᏐྻ Aɼ㠥Ұஈେԙ ౳ԙ pivot

    తᏐྻ Bɻ

  19. Conquer ༝ԙࢠᏐྻቮඃ pivot ෼ҝၷஈɼҰஈ খԙ౳ԙ pivot తᏐྻ Aɼ㠥Ұஈେԙ ౳ԙ pivot

    తᏐྻ Bɻ A B C

  20. 2 2

  21. 2 2 1

  22. 2 2 1

  23. 1 2 1 2 2 5 2 5 1 6

  24. 1 2 1 2 2 5 2 5 1 6

  25. 5 6 1 2 1 2 5 6 2 5

    2 5 1 6 4

  26. 5 6 1 2 1 2 5 6 2 5

    2 5 1 6 4

  27. 4 5 6 5 6 1 2 1 2 4

    5 6 5 6 2 5 2 5 1 6 4 3

  28. 4 5 6 5 6 1 2 1 2 4

    5 6 5 6 2 5 2 5 1 6 4 3

  29. 1 2 3 4 5 6 4 5 6 5

    6 1 2 1 2 4 5 6 5 6 1 2 3 4 5 6 9 2 5 2 5 9 1 6 4 3 8

  30. 1 2 3 4 5 6 4 5 6 5

    6 1 2 1 2 4 5 6 5 6 1 2 3 4 5 6 9 2 5 2 5 9 1 6 4 3 8

  31. 8 9 1 2 3 4 5 6 8 9

    4 5 6 5 6 1 2 1 2 4 5 6 5 6 1 2 3 4 5 6 9 2 5 2 5 9 7 1 6 4 3 8

  32. 8 9 1 2 3 4 5 6 8 9

    4 5 6 5 6 1 2 1 2 4 5 6 5 6 1 2 3 4 5 6 9 2 5 2 5 9 7 1 6 4 3 8

  33. 8 9 1 2 3 4 5 6 8 9

    4 5 6 5 6 1 2 1 2 4 5 6 5 6 1 2 3 4 5 6 1 2 3 4 5 6 7 8 9 9 2 5 2 5 9 7 1 6 4 3 8

  34. 9 3 How to Divide 4 1 5 8 6

    7 2

  35. 9 3 How to Divide 4 1 5 8 6

    4 7 2

  36. 9 3 How to Divide 4 1 5 8 6

    4 7 2

  37. 9 3 How to Divide 4 1 5 8 6

    4 7 2

  38. 9 3 How to Divide 4 1 5 8 6

    4 7 2

  39. 9 3 How to Divide 4 1 5 8 6

    4 7 2

  40. 9 3 How to Divide 4 1 5 8 6

    4 7 2

  41. 9 3 How to Divide 4 1 5 8 6

    4 7 2

  42. 9 3 How to Divide 4 1 5 8 6

    4 7 2

  43. 9 3 How to Divide 4 1 5 8 6

    4 7 2

  44. 9 3 How to Divide 4 1 5 8 6

    4 7 2 4 1 3 2 5 8 7 9 6

  45. 5 6 7 8 9 3 2 1 4 How

    to Conquer

  46. 5 6 7 8 9 3 2 1 4 How

    to Conquer

  47. 5 6 7 8 9 3 2 1 4 How

    to Conquer

  48. 5 6 7 8 9 3 2 1 4 How

    to Conquer

  49. void quickSort( int L, int R ) { if (

    R - L <= 1 ) return; int pivot = N[ R - 1 ], p = L; for ( int i = L; i < R - 1; ++i ) { if ( N[ i ] <= pivot ) { swap( N[ i ], N[ p ] ); ++p; } } swap( N[ R - 1 ], N[ p ] ); quickSort( L, p ); quickSort( p + 1, R ); } In-place Version

  50. 9 4 3 6 5 1 8 7 How to

    Divide 2

  51. 9 4 3 6 5 1 8 7 How to

    Divide 2 6

  52. 9 4 3 6 5 1 8 7 How to

    Divide 2 2 6

  53. 9 4 3 6 5 1 8 7 How to

    Divide 2 2 6

  54. 9 4 3 6 5 1 8 7 How to

    Divide 2 2 2 6

  55. 9 9 4 3 6 5 1 8 7 How

    to Divide 2 2 2 6

  56. 9 9 4 4 3 6 5 1 8 7

    How to Divide 2 2 2 9 6

  57. 9 9 4 4 3 6 5 1 8 7

    How to Divide 2 2 2 9 6

  58. 9 9 4 4 3 6 5 1 8 7

    How to Divide 2 2 2 9 4 6

  59. 9 9 4 4 3 3 6 5 1 8

    7 How to Divide 2 2 2 9 4 6

  60. 9 9 4 4 3 3 6 5 1 8

    7 How to Divide 2 2 2 9 4 6

  61. 9 9 4 4 3 3 6 5 1 8

    7 How to Divide 2 2 2 9 4 3 6

  62. 9 9 4 4 3 3 6 5 1 8

    7 8 How to Divide 2 2 2 9 4 3 6

  63. 9 9 4 4 3 3 6 5 1 8

    7 8 8 How to Divide 2 2 2 9 4 3 6

  64. 9 9 4 4 3 3 6 5 1 8

    7 8 7 8 How to Divide 2 2 2 9 4 3 6

  65. 9 9 4 4 3 3 6 5 1 8

    7 8 7 8 7 How to Divide 2 2 2 9 4 3 6

  66. 9 9 4 4 3 3 6 5 1 5

    8 7 8 7 8 7 How to Divide 2 2 2 9 4 3 6

  67. 9 9 4 4 3 3 6 5 1 5

    8 7 8 7 8 7 How to Divide 2 2 2 9 4 3 6

  68. 9 9 4 4 3 3 6 5 1 5

    8 7 8 7 8 7 How to Divide 2 2 2 5 9 4 3 6

  69. 9 9 4 4 3 3 6 5 1 5

    8 7 8 7 8 7 How to Divide 2 2 2 5 9 4 3 1 6

  70. 9 9 4 4 3 3 6 5 1 5

    8 7 8 7 8 7 How to Divide 2 2 2 5 9 4 3 1 6

  71. 9 9 4 4 3 3 6 5 1 5

    8 7 8 7 8 7 How to Divide 2 2 2 5 9 4 3 1 1 6

  72. 9 9 4 4 3 3 6 5 1 5

    8 7 8 7 8 7 How to Divide 2 2 2 5 9 4 3 1 1 6

  73. 9 9 4 4 3 3 6 5 1 5

    8 7 8 7 8 7 How to Divide 2 2 2 5 9 4 3 1 1 6 2 5 4 3 1 8 9 7

  74. 6 How to Conquer 1 4 2 3 5 8

    7 9 1 4 2 3 5 8 7 9

  75. 6 How to Conquer 1 4 2 3 5 8

    7 9 1 4 2 3 5 8 7 9

  76. End