| Content | Status | |
|---|---|---|
| 1 | Sort Algorithm: Bubble Sort | ☑ |
| 2 | Sort Algorithm: Selection Sort | ☑ |
| 3 | Sort Algorithm: Insertion Sort | ☑ |
| 4 | Sort Algorithm: Quick Sort | ☑ |
| 5 | Sort Algorithm: Merge Sort | ☑ |
| 6 | Sort Algorithm: Heap Sort | ☑ |
| 7 | Search Algorithm: Sequential Search | ☑ |
| 8 | Search Algorithm: Binary Search | ☑ |
| 9 | Data Structure: List - Array List | ☑ |
| 10 | Data Structure: List - Singly Linked List | ☑ |
| 11 | Data Structure: List - Double Linked List | ☑ |
| 12 | Data Structure: Stack - Array Stack | ☑ |
| 13 | Data Structure: Stack - Linked Stack | ☑ |
| 14 | Data Structure: Queue - Array Queue | ☑ |
| 15 | Data Structure: Queue - Linked Queue | ☑ |
| 16 | Data Structure: Priority Queue - Unsorted Array Priority Queue | ☑ |
| 17 | Data Structure: Priority Queue - Sorted Array Priority Queue | ☑ |
| 18 | Data Structure: Priority Queue - Unsorted Linked Priority Queue | ☑ |
| 19 | Data Structure: Priority Queue - Sorted Linked Priority Queue | ☑ |
| 20 | Data Structure: Priority Queue - Min Heap Priority Queue | ☑ |
| 21 | Data Structure: Tree - Binary Search Tree | ☑ |
| 22 | Data Structure: Tree - AVL Tree | ☑ |
Sort Algorithms will be executed on an array with 6 features:
Shuffle: Shuffle position of elements in current array.Generate New: Generate new array, each element will have random value in range [1 - 99].Array size: The size of array. You can change this value in range [2 - 128].Elements: The elements in current array. You can custom set each element value in array with value in range [1 - 99].Animation Speed: Period of each animation step. You can set animation speed with min value is 10 (ms) (this is the fastest case).Start sort | Pause sort | Continue sort: You can start the sort animation, pause it or continue if you want.
Sort Algorithms will be executed on an array with 7 features:
Shuffle: Shuffle position of elements in current array.Generate New: Generate new array, each element will have random value in range [1 - 99].Array size: The size of array. You can change this value in range [2 - 128].Elements: The elements in current array. You can custom set each element value in array with value in range [1 - 99].Value searching: The value which you want to search in current array. You can set this value in range [1- 99].Animation Speed: Period of each animation step. You can set animation speed with min value is 10 (ms) (this is the fastest case).Start sort | Pause sort | Continue sort: You can start the sort animation, pause it or continue if you want.
Data Structures will have 3 features:
-
Animation Speed: Period of each animation step. You can set animation speed with min value is 500 (ms) (this is the fastest case). -
Choose Action: You can choose a method of current data structure which you want to see visualization-
List: Have 5 actions
add(value),add(index, value),get(index),remove(index),remove(value)
-
Stack: Have 2 actions
push(value),pop()
-
Queue: Have 2 actions
enqueue(value),dequeue()
-
Priority Queue: Have 2 actions
insert(key, value),removeMin()
-
Tree: Have 8 actions includes
6 traversal methods,insert(value),delete(value)
-
-
Run Action: Run animation with selected method. When you started animation, you can't pause it.