[racket] (no subject)

On Sun, Dec 9, 2012 at 4:53 PM, Dman P <dmandus at gmail.com> wrote:

> can somr one give me an overview on programing speeds and Big O
>

I do not understand your question. Without more information on what you're
asking, I'll guess.  (But what does your question have to do with Racket?)

---

Every algorithms book will talk about asymptotic notation. Introduction to
Algorithms is a good one:

    http://mitpress.mit.edu/books/introduction-algorithms


Wikipedia has a table of common classes of asymptotic functions:


http://en.wikipedia.org/wiki/Time_complexity#Table_of_common_time_complexities
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20121209/a4771346/attachment.html>