acm_talk_nov_5_2015

##Introduction to Data Structures, in 20 minutes

A Data Structure is a way to persist an organized set of data across a program. It is a recipe for the pattern a data will take on, with implications into access, storage, and functionality of a program.

References

hashes: http://www.laurentluce.com/posts/python-dictionary-implementation/

hashes implementation: https://sites.google.com/site/usfcomputerscience/hash-tables-imp

binary heaps: http://interactivepython.org/runestone/static/pythonds/Trees/BinaryHeapImplementation.html

deque: http://interactivepython.org/runestone/static/pythonds/BasicDS/WhatIsaDeque.html

deque implementation: http://interactivepython.org/runestone/static/pythonds/BasicDS/ImplementingaDequeinPython.htmlt

binary search: http://interactivepython.org/runestone/static/pythonds/SortSearch/TheBinarySearch.html

graph algorithms:

http://interactivepython.org/runestone/static/pythonds/Graphs/GeneralDepthFirstSearch.html

http://interactivepython.org/runestone/static/pythonds/Graphs/PrimsSpanningTreeAlgorithm.html

http://interactivepython.org/runestone/static/pythonds/Graphs/DijkstrasAlgorithm.html

database ideas:

http://code.activestate.com/recipes/577825/

http://stackoverflow.com/questions/17373024/python-database-implementation

http://gadfly.sourceforge.net/

If there is time:

http://pythonhosted.org/facereclib/index.html