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

Quick Sort

Sponsored · SiteGround - Reliable hosting with speed, security, and support you can count on. →
Avatar for KuoE0 KuoE0
March 15, 2013
Programming
10k
5

Quick Sort

Avatar for KuoE0

KuoE0

March 15, 2013

More Decks by KuoE0

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

Other Decks in Programming

See All in Programming
2026年のソフトウェア開発を考える（2026/05版） / Software Engineering Scrum Fest Niigata 2026 Edition
Avatar for Takuto Wada twada
PRO
24
14k
「OSSがあるなら自作するな」は AI時代も正しいか ── Build vs Adopt の新しい判断基準
Avatar for Kumo Ishikawa kumorn5s
7
2.9k
AIチームを指揮するOSS「TAKT」活用術 / How to Use “TAKT,” an OSS Tool for Orchestrating AI Teams
Avatar for nrs nrslib
4
490
OCRを使ってゲームのアイテムをデータ化する
Avatar for Kishikawa Katsumi kishikawakatsumi
0
110
プロパティの順序で型推論が壊れる!? TypeScript6.0の修正からContext-Sensitivityの仕組みを追う
Avatar for おおいし bicstone
2
800
Moments When Things Go Wrong
Avatar for Aurimas Liutikas aurimas
3
100
Oxlintはいかにしてtsgolintのlint ruleを呼び出しているのか
Avatar for syumai syumai
1
420
サークル参加から学ぶ、小さな事業の回し方
Avatar for yuzneri yuzneri
0
220
Augmenting AI with the Power of Jakarta EE
Avatar for ivargrimstad ivargrimstad
0
620
Transactional Change Stream Processing With Debezium and Apache Flink
Avatar for Gunnar Morling gunnarmorling
1
120
My daily life on Ruby
Avatar for Akira Matsuda a_matsuda
3
430
密結合なバックエンドから TypeScript のコードを生成する
Avatar for kemuridama kemuridama
1
300

Featured

See All Featured
Imperfection Machines: The Place of Print at Facebook
Avatar for Scott Boms scottboms
270
14k
The Invisible Side of Design
Avatar for Vitaly Friedman smashingmag
302
52k
The Illustrated Guide to Node.js - THAT Conference 2024
Avatar for David Neal reverentgeek
1
350
So, you think you're a good person
Avatar for Per Axbom axbom
PRO
2
2k
職位にかかわらず全員がリーダーシップを発揮するチーム作り / Building a team where everyone can demonstrate leadership regardless of position
Avatar for MADOX madoxten
62
54k
How to build an LLM SEO readiness audit: a practical framework
Avatar for Nick Samuel nmsamuel
1
750
SEOcharity - Dark patterns in SEO and UX: How to avoid them and build a more ethical web
Avatar for Sara Fernández Carmona sarafernandez
0
190
Lessons Learnt from Crawling 1000+ Websites
Avatar for Charles Meaden charlesmeaden
PRO
1
1.2k
Become a Pro
Avatar for Speaker Deck speakerdeck
PRO
31
5.9k
Paper Plane (Part 1)
Avatar for Katie Cordina Lindsey katiecoart
PRO
0
7.7k
Making the Leap to Tech Lead
Avatar for Ryan Cromwell cromwellryan
135
9.8k
Building a A Zero-Code AI SEO Workflow
Avatar for Ian Lurie portentint
PRO
0
530

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