MIT's Introduction to Algorithms, Lecture 12

programming

Visit http://www.catonmat.net for transcription of this lecture and lecture notes. Lecture 12: Skip lists. Building skip lists from scratch. Search operation. Insert operation. Expected running time analysis of operations. Ps. MIT OCW lectures are released under CC license, so I had all the legal rights to upload them to Google Video. For more information visit: http://ocw.mit.edu/OcwWeb/web/terms/terms/index.htm