Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
gnuvince
on July 27, 2013
|
parent
|
context
|
favorite
| on:
Big-O notation explained by a self-taught programm...
I think that Sedgewick's tilde notation [1] is nice if you want to include more information about constant factors.
[1]
http://algs4.cs.princeton.edu/14analysis/
AYBABTME
on July 27, 2013
[–]
His tilde notation is also more informative than the big-O one. The canonical example is Quicksort. If you look at its big-O time complexity, it's O(n^2). When for all practical cases, it's ~n log n.
Consider applying for YC's Summer 2025 batch! Applications are open till May 13
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
[1] http://algs4.cs.princeton.edu/14analysis/