1
edit
Changes
→TRIE
* [https://cs.senecac.on.ca/~catherine.leung/sketches/bubble.html presentation]
==== Merge sort ====
* [http://www.inf.fh-flensburg.de/lang/algorithmen/sortieren/merge/mergen.htm example]
==== Hash Table====
* [http://acc6.its.brooklyn.cuny.edu/~cis22/hashing/Linear.html Linear probing] -[http://www.daniweb.com/software-development/c/threads/100844]* [http://acc6.its.brooklyn.cuny.edu/~cis22/hashing/Linked.html chaining] - [http://www.daniweb.com/software-development/c/threads/104887]
* [http://www.sparknotes.com/cs/searching/hashtables/section1.html graph]
* [http://www.algolist.net/Data_structures/Hash_table/Simple_example simple example]
* [http://msdn.microsoft.com/en-us/library/ms379571(v=vs.80).aspx msdn]
* [http://eternallyconfuzzled.com/tuts/datastructures/jsw_tut_hashtable.aspx collision resolution]
* [http://en.wikipedia.org/wiki/Hash_table#Resizing_by_copying_all_entries wiki hash table]
* [http://www.cs.auckland.ac.nz/software/AlgAnim/hash_tables.html analysis]
==== TRIE ====
* [http://www.technicalypto.com/2010/04/trie-in-java.html trie in java]
* [http://www.cs.bu.edu/teaching/c/tree/trie/ sample]
* [http://www.technicalypto.com/search/label/C%2B%2B trie c++]
==== Linked list====
* [http://www.cplusplus.com/articles/E3wTURfi/ linked list and binary search tree]
==== templates====
* [http://www.iis.sinica.edu.tw/~kathy/vcstl/templates.htm good tutorial]
==== sample codes ====
* [http://lua-users.org/wiki/SampleCode general - on data structure]
