Difference between revisions of "User:Minooz/DSA"
(→Selection Sort) |
(→TRIE) |
||
| (7 intermediate revisions by the same user not shown) | |||
| Line 32: | Line 32: | ||
* [https://cs.senecac.on.ca/~catherine.leung/sketches/animarray.pde animarray.pde] | * [https://cs.senecac.on.ca/~catherine.leung/sketches/animarray.pde animarray.pde] | ||
* [https://cs.senecac.on.ca/~catherine.leung/sketches/bubble.html presentation] | * [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] | ||
Latest revision as of 21:04, 26 November 2011
Contents
Data Structure
Resources
Animation - processing.js
Processing.js @ http://processingjs.org/
Selection Sort
- in wikipedia
- in javascript
- implementation in various languages
- How to run and debug the sketch in Eclipse:
- 2- Clone the processing repository to get the processing-core and the plug-in for Eclipse -> svn checkout http://processing.googlecode.com/svn/trunk/ processing-read-only
- 3- Run the plug-in as Eclipse Application
- Switch to processing perspective.
- New -> processing sketch -> choose the name and the folder.
- Insert your processing sketch code in the sample .pde file that is created as default in the workspace.
- run the code as processing sketch.
- This will generate the .java code form the .pde file which can be found in the source folder in the file system.
- 4- Copy the generated .java file and paste it in a new package beside the processing-core package in the main instance of Eclipse application.
- Now you can debug the code....
Bubble sort - Cathy
Merge sort
Hash Table
- Linear probing -[1]
- chaining - [2]
- graph
- simple example
- msdn
- collision resolution
- wiki hash table
- analysis
TRIE
Linked list
templates
