Oct. 18, 2016
Plan to spend 2+ hour to work on the algorithm called:
https://web.stanford.edu/class/cs97si/09-computational-geometry.pdf
"For example, instead of presenting sorting algorithms and balanced search trees separately, I prefer to discuss applications that integrate them such as geometric plane sweep algorithms. I believe this problem oriented exposition is helpful for using the tools later on, as well as for moving towards open-ended exploration in an area."
Teaching statement from
http://www.cc.gatech.edu/~rpeng/teachingstatement.pdf
10/20/2016
3:30am - 5:00am, (work with jet lag)
read 30 minutes about balanced search tree:
https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree
and then, associated array
https://en.wikipedia.org/wiki/Associative_array
No comments:
Post a Comment