<p>oh ok, so if it says "dominate", just compare big-O?</p>
<p>O(n^2) is the worst right?</p>
<p>and is O (n log n) more efficient than O(log n)</p>
<p>bump 10 char</p>
<p>It goes, from more efficient to less efficient, O(log n) < O(n) < O(n log n).</p>
<p>ok...wow...i'm not even going to study for stats...giving all my time for comp sci ab...so scr*wed for it...</p>
<p>ok i give up on comp sci...b4...i risk losing all my other aps along w/ it...gl! to the rest of you guys!!! =(</p>
<p>well
glhf</p>
<p>we'll go down together it seems.</p>
<p>wait, Didnotfaillife, doesn't quicksort have O(n log n) but it's the most efficient? confused</p>
<p>Good website for sorts
<a href="http://linux.wku.edu/%7Elamonml/algor/sort/sort.html%5B/url%5D">http://linux.wku.edu/~lamonml/algor/sort/sort.html</a></p>
<p>:-| However, well still trying to be positive about tomorrow.</p>
<p>well, good luck everyone!</p>
<p>You have to know how to write recursions....number 4 on the past 2006 FRQ makes you write a huge recursive thing that's really hard to do ARGH im gonna fail. :(</p>
<p>recursion is actually never required unless they specifically state so. If I remember correctly, that question also could've been solved by using a Queue.</p>
<p>Let's all fail together so the curve is really big!</p>
<p>Was barron's harder or helpful?</p>
<p>We used the Barron's book in our class optionally and I must say that it was really good at pointing out stuff you might not have thought about otherwise. Yeah, a lot of the book is harder, but its best to go into very well prepared than just prepared enough. Unfortunately, I only got to chapter 7 or 8 before taking the test, so I didn't get the full effect.</p>