Yiling, Sun (2001) Data structure animation tutorial. Other thesis, Concordia University.
This study is an animation tutorial for the people who wants to learn the Data Structure. The emphasis is placed on vivid animations to help the people to understand algorithms for data structure easily. Some of the implementations to be addressed are: stack (Array-Based Stack, Linked Stack), queue (Array-Based Queue), List (Circular Linked List, Double Linked List, Linear Linked List), sort (Quick Sort, Merge Sort, Bubble Sort, Shell Sort, Insertion Sort, Heap Sort, Radix Sort, Selection Sort), heap (Priority Queue, Heap Build, Heap Sort), recursive (Tower of Hanio), hashing (Open Hashing, Close Hashing) binary search (Loop, Recursive), tree (2-3 Tree, Huffman Tree, Binary Search Tree, Balance Tree). Conclusions are formulated in terms of further work to be accomplished in order to better help understanding the completed algorithm.
|Divisions:||Concordia University > Faculty of Engineering and Computer Science > Computer Science and Software Engineering|
|Item Type:||Thesis (Other)|
|Pagination:||iii, 63 leaves : ill. ; 29 cm.|
|Degree Name:||Major reports (M.Comp.Sc.)|
|Program:||Computer Science and Software Engineering|
|Thesis Supervisor(s):||Tao, Lixin|
|Deposited By:||Concordia University Libraries|
|Deposited On:||27 Aug 2009 17:19|
|Last Modified:||04 Nov 2016 19:37|
Repository Staff Only: item control page