Animations

• Hash table with separate chaining
  • Choose the size of the table and click on Create Bucket Now
  • Click on Step by Step and choose Continuous
  • Click on Execute
  • Adjust the speed.
  • You can remove some of the data items (lower right window). Click on the item to be deleted and then click on Delete.
  • You can add new data items by typing them in the box labelled Item, and then clicking on Add.
  The hash function is computed by adding the integer representations of the characters of the string and then taking modulo the size of the table.
  The number of collisions reported is the number of entries where a collision was detected.

• A simple interactive binary search tree

• AVL tree

• Max heap

• Depth First Search

• Breadth First Search

• Dijkstra's Algorithm

• Kruskal's Algorithm