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
420
Windows 真的不好用...
Avatar for KuoE0 kuoe0
0
300
Python @Wheel Lab
Avatar for KuoE0 kuoe0
0
220
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
公共交通オープンデータ × モバイルUX 複雑な運行情報を 『直感』に変換する技術
Avatar for Tsubasa SEKIGUCHI tinykitten
PRO
0
180
Vibe codingでおすすめの言語と開発手法
Avatar for uyuki uyuki234
0
160
[AtCoder Conference 2025] LLMを使った業務AHCの上⼿な解き⽅
Avatar for terry-u16 terryu16
6
1k
HTTPプロトコル正しく理解していますか？ 〜かわいい猫と共に学ぼう。ฅ^•ω•^ฅ ﾆｬ〜
Avatar for ♛Heitor Hirose hekuchan
2
590
Graviton と Nitro と私
Avatar for maroon1st maroon1st
0
160
副作用をどこに置くか問題：オブジェクト指向で整理する設計判断ツリー
Avatar for Koya Masuda koxya
1
200
2年のAppleウォレットパス開発の振り返り
Avatar for muno92 muno92
PRO
0
180
Claude Codeの「Compacting Conversation」を体感50%減！ CLAUDE.md + 8 Skills で挑むコンテキスト管理術
Avatar for Kazuki Murahama kmurahama
1
700
Deno Tunnel を使ってみた話
Avatar for すずとも kamekyame
0
300
QAフローを最適化し、品質水準を満たしながらリリースまでの期間を最短化する #RSGT2026
Avatar for shibayu36 shibayu36
0
1k
Combinatorial Interview Problems with Backtracking Solutions - From Imperative Procedural Programming to Declarative Functional Programming - Part 2
Avatar for Philip Schwarz philipschwarz
PRO
0
130
Pythonではじめるオープンデータ分析〜書籍の紹介と書籍で紹介しきれなかった事例の紹介〜
Avatar for Ryo YOSHI welliving
3
750

Featured

See All Featured
The World Runs on Bad Software
Avatar for Brandon Keepers bkeepers
PRO
72
12k
So, you think you're a good person
Avatar for Per Axbom axbom
PRO
0
1.9k
HU Berlin: Industrial-Strength Natural Language Processing with spaCy and Prodigy
Avatar for Ines Montani inesmontani
PRO
0
120
Chrome DevTools: State of the Union 2024 - Debugging React & Beyond
Avatar for Addy Osmani addyosmani
9
1k
How To Stay Up To Date on Web Technology
Avatar for Chris Coyier chriscoyier
791
250k
Optimising Largest Contentful Paint
Avatar for Harry Roberts csswizardry
37
3.5k
Money Talks: Using Revenue to Get Sh*t Done
Avatar for Nikki Halliwell nikkihalliwell
0
130
Noah Learner - AI + Me: how we built a GSC Bulk Export data pipeline
Avatar for Tech SEO Connect techseoconnect
PRO
0
78
Lightning Talk: Beautiful Slides for Beginners
Avatar for Ines Montani inesmontani
PRO
1
410
Building a A Zero-Code AI SEO Workflow
Avatar for Ian Lurie portentint
PRO
0
220
The innovator’s Mindset - 
Leading Through an Era of Exponential Change - McGill University 2025
Avatar for Jean-Marc De Jonghe jdejongh
PRO
1
74
Embracing the Ebb and Flow
Avatar for Simon Collison colly
88
4.9k

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