# 演算法_鮑興國 ## 6 ## 7. Quicksort ### Key - quicksort 的 worst case 明明比 merge sort 還慢,為什麼還那麼常用? - 平均情況 quicksort 會比 merge sort 快 - 我們可以對 input 做一些處理避免 worst case (打亂、重新排序)
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up