We present a visualization of a closed hashing algorithm. We have studied how to make quickly adaptive animations of algorithms with the Microsoft Excel spreadsheet program. All the phases of our approach are easy to carry out for even a novice in Computer Science familiar with the basics of Excel. Our approach is ideal for course assignments in many areas of Computer Science, and it can be applied even in research. Here is an example in detail to clarify our ideas.
Binary search is a well-known method for searching for an item in a sorted array.
In the beginning the search range is the whole array. Then the search key is compared with the middle element of the range. If they are equal, the wanted item has been found. If the key is smaller, the same procedure is applied recursively to the left half of the search range, otherwise to the right half. Put data structures to the worksheet To animate this search algorithm, a chart which represents the array has to be formed.