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

Quick Sort

Avatar for KuoE0 KuoE0
March 15, 2013
Programming
11k
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
320
應徵軟體工程師
Avatar for KuoE0 kuoe0
0
190
面試心得分享
Avatar for KuoE0 kuoe0
0
440
Windows 真的不好用...
Avatar for KuoE0 kuoe0
0
330
Python @Wheel Lab
Avatar for KuoE0 kuoe0
0
250
Introduction to VP8
Avatar for KuoE0 kuoe0
0
310
Python @NCKU_CSIE
Avatar for KuoE0 kuoe0
0
150
[ACM-ICPC] Tree Isomorphism
Avatar for KuoE0 kuoe0
1
280

Other Decks in Programming

See All in Programming
AIと壁打ちしながら進めるコスト管理
Avatar for Ryoma Fujiwara fufuhu
2
1.7k
人間の目はかわらない、だからJPEGは30年もつ
Avatar for yuzneri yuzneri
12
19k
Go 1.27 における memory allocation の高速化
Avatar for ANDPAD inc andpad
0
330
仕様書を書く前にハーネスを作る - Agent Native開発は「探索を速く、判定を固く」
Avatar for Gota gotalab555
5
1.8k
Introducing Stack Pull Request in GitHub
Avatar for KAMEGAWA Kazushi kkamegawa
0
110
承認済みなのに差戻しできてしまうバグ、型で潰せます
Avatar for SHINCHI Takahiro shinchit
0
110
AWS Transform Custom による Spring Boot 2.xから4.xへのVerUp
Avatar for Satoshi Kaneyasu satoshi256kbyte
2
110
VibeCodingからAgenticWorkflowへ
Avatar for starfish719 starfish719
0
890
信頼性の目標を誰も求めてない
Avatar for Shuma shubox
0
120
Press start. Python's next generation.
Avatar for Carol Willing willingc
PRO
3
190
まだ間に合う！今年の夏こそSchemeのマクロ展開器を完全理解！
Avatar for Masanori Ogino omasanori
0
510
Claude CodeとAgentCore Gatewayを繋ぐ際の認証認可 / Authentication and authorization when connecting Claude Code with AgentCore Gateway
Avatar for Har1101 har1101
2
380

Featured

See All Featured
Measuring & Analyzing Core Web Vitals
Avatar for Philip Tellis bluesmoon
9
970
Context Engineering - Making Every Token Count
Avatar for Addy Osmani addyosmani
9
1.1k
How To Speak Unicorn (iThemes Webinar)
Avatar for Michelle Schulp Hunt marktimemedia
1
560
JavaScript: Past, Present, and Future - NDC Porto 2020
Avatar for David Neal reverentgeek
52
6.1k
Breaking role norms: Why Content Design is so much more than writing copy - Taylor Woolridge
Avatar for UX Y'all uxyall
1
380
A brief & incomplete history of 
UX Design for the World Wide Web: 1989–2019
Avatar for Jason CranfordTeague jct
2
490
No one is an island. Learnings from fostering a developers community.
Avatar for Antonio thoeni
21
3.8k
Test your architecture with Archunit
Avatar for Yoan thirion
2
2.4k
Jamie Indigo - Trashchat’s Guide to Black Boxes: Technical SEO Tactics for LLMs
Avatar for Tech SEO Connect techseoconnect
PRO
0
630
Evolution of real-time – Irina Nazarova, EuRuKo, 2024
Avatar for Irina Nazarova irinanazarova
9
1.5k
Leo the Paperboy
Avatar for Maya Tellez mayatellez
8
2.2k
Fashionably flexible responsive web design (full day workshop)
Avatar for Andy Clarke malarkey
408
67k

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