On Saturday 13 December 2008 15:35, Randall R Schulz wrote: > ... > > Any algorithm that requires to O(n) steps is itself O(n).
And by that I meant "...two O(n) steps...", of course. > The big-O concept is roughly "equality up to a constant factor." Randall Schulz --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
