Re:Big-O notation explained by a self-taught programmer
by AYBABTME on Saturday July 27, 2013 @11:33AM
(#6113254)
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.
[ Parent
| on HN ]
There are no comments on this comment yet.