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
98
面試面試面試，因為很重要所以要說三次！
Avatar for KuoE0 kuoe0
2
240
應徵軟體工程師
Avatar for KuoE0 kuoe0
0
160
面試心得分享
Avatar for KuoE0 kuoe0
0
410
Windows 真的不好用...
Avatar for KuoE0 kuoe0
0
280
Python @Wheel Lab
Avatar for KuoE0 kuoe0
0
210
Introduction to VP8
Avatar for KuoE0 kuoe0
0
250
Python @NCKU_CSIE
Avatar for KuoE0 kuoe0
0
120
[ACM-ICPC] Tree Isomorphism
Avatar for KuoE0 kuoe0
1
250

Other Decks in Programming

See All in Programming
Constant integer division faster than compiler-generated code
Avatar for herumi herumi
1
110
令和最新版手のひらコンピュータ
Avatar for KOBA789 koba789
2
600
Claude Code で Astro blog を Pages から Workers へ移行してみた
Avatar for Kei Kamikawa codehex
0
170
QA x AIエコシステム段階構築作戦
Avatar for Osu osu
0
240
Comparing decimals in Swift Testing
Avatar for 417.72KI 417_72ki
0
160
ZeroETLで始めるDynamoDBとS3の連携
Avatar for afooooil afooooil
0
150
#QiitaBash TDDで(自分の)開発がどう変わったか
Avatar for Tommy(sigma) ryosukedtomita
1
350
No Install CMS戦略 〜 5年先を見据えたフロントエンド開発を考える / no_install_cms
Avatar for Masahiko Sakakibara rdlabo
0
430
DMMを支える決済基盤の技術的負債にどう立ち向かうか / Addressing Technical Debt in Payment Infrastructure
Avatar for yoshiyoshifujii yoshiyoshifujii
5
760
decksh - a little language for decks
Avatar for Anthony Starks ajstarks
4
21k
商品比較サービス「マイベスト」における パーソナライズレコメンドの第一歩
Avatar for Ucchiii ucchiii43
0
270
DatadogのArchived LogsをSnowflakeで高速に検索する方法（Archive Searchでオワコンにならないことを祈って） / How to search Datadog Archived Logs quickly with Snowflake (hoping Datadog Archive Search doesn’t make this obsolete)
Avatar for Civitaspo civitaspo
0
110

Featured

See All Featured
Bash Introduction
Avatar for André Augusto Costa Santos 62gerente
614
210k
Why You Should Never Use an ORM
Avatar for John Nunemaker jnunemaker
PRO
58
9.5k
The Pragmatic Product Professional
Avatar for Laura Van Doore lauravandoore
36
6.8k
The Success of Rails: Ensuring Growth for the Next 100 Years
Avatar for Eileen M. Uchitelle eileencodes
46
7.5k
Stop Working from a Prison Cell
Avatar for Chris Michel hatefulcrawdad
271
21k
Sharpening the Axe: The Primacy of Toolmaking
Avatar for Bryan Cantrill bcantrill
44
2.4k
Helping Users Find Their Own Way: Creating Modern Search Experiences
Avatar for Dan Newman danielanewman
29
2.8k
The Cult of Friendly URLs
Avatar for Andy Hume andyhume
79
6.5k
Put a Button on it: Removing Barriers to Going Fast.
Avatar for kastner kastner
60
3.9k
[RailsConf 2023 Opening Keynote] The Magic of Rails
Avatar for Eileen M. Uchitelle eileencodes
29
9.6k
Agile that works and the tools we love
Avatar for Rasmus Luckow-Nielsen rasmusluckow
329
21k
Dealing with People You Can't Stand - Big Design 2015
Avatar for Cassini Nazir cassininazir
367
26k

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