<html><head></head><body bgcolor="#FFFFFF"><div>Thanks for point me the right dirction sorry for the bad qustion<br><br>Dustin Prusisz <div><br></div></div><div><br>On Dec 9, 2012, at 9:24 PM, Danny Yoo <<a href="mailto:dyoo@hashcollision.org">dyoo@hashcollision.org</a>> wrote:<br><br></div><div></div><blockquote type="cite"><div><br><br><div class="gmail_quote">On Sun, Dec 9, 2012 at 4:53 PM, Dman P <span dir="ltr"><<a href="mailto:dmandus@gmail.com" target="_blank">dmandus@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"> <div>can somr one give me an overview on programing speeds and Big O </div><div></div></blockquote><div><br></div><div>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?)</div> <div><br></div><div>---</div><div><br></div><div>Every algorithms book will talk about asymptotic notation. Introduction to Algorithms is a good one:</div><div><br></div><div>    <a href="http://mitpress.mit.edu/books/introduction-algorithms">http://mitpress.mit.edu/books/introduction-algorithms</a></div> <div> </div><div><br></div><div>Wikipedia has a table of common classes of asymptotic functions:</div><div><br></div><div>    <a href="http://en.wikipedia.org/wiki/Time_complexity#Table_of_common_time_complexities">http://en.wikipedia.org/wiki/Time_complexity#Table_of_common_time_complexities</a></div> <div><br></div></div> </div></blockquote></body></html>