Khanacademy has some good resources, seemingly, including teaching Big-O notation. Also, if you are familiar with a programming language in particular, Rosetta

Khanacademy has some good resources, seemingly, including teaching Big-O notation. Also, if you are familiar with a programming language in particular, Rosetta Code can give you an example of the algorithm in that language. But in my experience (which should be taken with a grain of salt, as a person who never took cs and never took calculus), understanding algorithms doesn't take a lot of math, just a bit of persistance in understanding how they work, and a dash of common sense. The hardest math is that behind calculating big-O for time and space, which can again be approximated for most simple algorithms with a bit of common sense. This (http://stackoverflow.com/questions/487258/plain-english-explanation-of-big-o http://stackoverflow.com/questions/487258/plain-english-expl...) stackoverflow is probably the best explanation I've seen. SOME ALGORITHMS TO KNOW: -Quicksort -Mergesort -Binary Search -Searching a single-linked list -Hashtable insertion/deletion -Djkstra's Algorithm -Heap Sort -Huffman Encoding You don't have to know all of these, and the difficulty of understanding varies, but these are important, and a good place to start.