Nice YouTube review videos for sorting, Big O, Big Omega, Big Theta

[Devendra Owens]

Professor Lowman's explanations of these topics were pretty bad imho. His notes/handwriting even worse, knowing that this is going to be on the final (we went over it in class for a whole week, so yeah its fair game) I found these YouTube videos which are super helpful:

http://www.youtube.com/watch?v=P00xJgWzz2c&list=HL1367592965

If you were confused by these topics I would highly recommend viewing these videos before the final as it breaks it down into very easy to digest steps. XoaXdotnet explains in 20 minutes what it took Lowman 3-4 classes to go over (granted it is pseudocode and not actual python code but easily transferable). Feel free to skip merge sort as we did not go over that in class

[S.F. Kyale]

Wow, that guy really makes it clear and comprehensible. The soothing music helps. Thank you for sharing.

--
You received this message because you are subscribed to the Google Groups "uic-mcs260-s13" group.
To unsubscribe from this group and stop receiving emails from it, send an email to uic-mcs260-s1...@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
 
 

[Jeremy Kun]

This is a topic I consider very important. In job interviews you will be asked to describe the runtime of algorithms in terms of big-O.

Jeremy Kun

Mathematics Graduate Student

University of Illinois at Chicago

[S.F. Kyale]

Have you any other recommendations of where people explain it well in writing or on the tube?

[Devendra Owens]

Soren this is what you shouldn't do :D

http://www.explainxkcd.com/wiki/index.php?title=1185:_Ineffective_Sorts

[Søren Kyale]

I rather liked the comic about n(log(log(n))

http://www.xkcd.com/342/

[Jeremy Kun]

Obligatory: http://stackoverflow.com/questions/2609857/are-there-any-worse-sorting-algorithms-than-bogosort-a-k-a-monkey-sort

Jeremy Kun

Mathematics Graduate Student

University of Illinois at Chicago

--