Hey guys, I wrote a set of lecture notes on data structures/algorithms on arrays, flow networks/max flow, and trees. They are geared toward beginners (those with very little experience). They are far from complete (first drafts), but please let me know what you think of them!
There are some small details that I sort of ignore in order to make the presentation easier (again, this is for beginners). One such error is section 3.4 on the array pdf (you can get an O(1) `set' with sqrt decomposition) — this is intentional. Not all of them are intentional, so if you notice any errors please let me know. Thank you and I hope you enjoy.
They are located here:
or if you don't want to click twice:
http://acm.cise.ufl.edu/ufpt/intro_to_array_datastructures.pdf http://acm.cise.ufl.edu/ufpt/intro_to_flow_networks_pt1.pdf http://acm.cise.ufl.edu/ufpt/intro_to_trees.pdf
