dsa.mov
- Separate Chaining: Visualizes how collisions are resolved using linked lists.
- Linear Hashing: Demonstrates the process of resolving collisions by probing sequentially.
- Quadratic Hashing: Shows collision resolution using quadratic probing.
- Double Hashing: Illustrates how a secondary hash function can be used for collision resolution.
- Bubble Sort: Repeatedly steps through the input list element by element, comparing the current element with the one after it, swapping their values if needed.
- Selection Sort: Visualizes the process of selecting the minimum element and swapping it with the current position.
- Insertion Sort: Demonstrates how elements are inserted into their correct position in the sorted portion of the array.
- Bucket Sort: Shows how elements are distributed into buckets and then sorted.
- Radix Sort: Illustrates sorting by digit position, using counting sort as a subroutine.
- Tree Traversals: Includes visualizations for:
- Pre-order Traversal: Visit root, left subtree, right subtree.
- In-order Traversal: Visit left subtree, root, right subtree.
- Post-order Traversal: Visit left subtree, right subtree, root.
- Level Order Traversal: Visit nodes level by level.
- Singly Linked List: Allows visualizing operations such as:
- Insert at Front: Add a node to the beginning of the list.
- Insert at End: Add a node to the end of the list.
- Insert at Index: Add a node at a specified position.
- Components: Modular components for different visualizations and controls.
- Svelte Features: Utilizes Svelte’s reactive features for real-time updates and animations.
The DSA Visualizer helps students understand data structures and algorithms by providing interactive visualizations. These visual aids make it easier to grasp complex concepts, see the effects of different operations, and enhance learning through engaging animations.