News for hackers. Stuff that matters.
Re:Big-O notation explained by a self-taught programmer by gnuvince on Saturday July 27, 2013 @10:02AM (#6112897)
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/

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.