What are some good online resources that will help me better understand BigO notation, running time & invariants?
I'm looking for lectures, interactive examples if possible.
$\begingroup$
$\endgroup$
5
-
3$\begingroup$ Have you considered reading a book? $\endgroup$– Raphael ♦Mar 21 '12 at 6:33
-
$\begingroup$ related question $\endgroup$– uliMar 21 '12 at 7:11
-
$\begingroup$ another related question $\endgroup$– uliMar 21 '12 at 7:13
-
3$\begingroup$ Are there particular problems you face, or things you are interested in? Your question does not seem to be very focused. $\endgroup$– Raphael ♦Mar 21 '12 at 14:38
-
1$\begingroup$ As @Raphael notes, this would be answered more effectively if you could include a bit of information on where you're stuck - presumably you have some understanding of these concepts; can you briefly outline where you're finding difficulty? $\endgroup$– Shog9Mar 23 '12 at 2:14
Add a comment
|
$\begingroup$
$\endgroup$
1
answered Mar 21 '12 at 3:14
-
$\begingroup$ Here's one more, i got last day, it's quiet new, the course for "Theory of Computation" and "Algorithms" is up-coming. $\endgroup$– Code0987Mar 21 '12 at 7:58
$\begingroup$
$\endgroup$
2
Since @Pratik's answer covers good resources for algorithms, I just wanted to mention that since you asked about big-O notation, Peter Braß has written a book on the topic, which you can find here.
Update: In response to the comments, I recommend this book for beginning students who are having trouble wrapping their head around big-O. (Yes, every algorithms book ever covers it to some extent, but my experience is that one of the most common questions on math.SE is still basically "I am having trouble with big-O", so there must be a place for a more expansive treatment.)
-
-
$\begingroup$ I recommend it for beginning CS students, and will mention it as a supplemental text the next time I teach algorithms. Peter's data structures text is also quite nice. $\endgroup$– LouisMar 29 '12 at 8:42