Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
partycoder
on June 30, 2017
|
parent
|
context
|
favorite
| on:
Pattern-defeating quicksort
Which decreases the space complexity but increases the time complexity.
_hrfd
on June 30, 2017
[–]
No, the time complexity is the same: O(n log n). The author of the top answer links to his book, where you can find a proof of time complexity:
https://sites.google.com/site/algoxy/home/elementary-algorit...
EvgeniyZh
on June 30, 2017
|
parent
[–]
...but it increases run time. It's fine not to care on hidden constants while analyzing algorithms, but not while using them in real life
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
