53 ;;Quote: an algorithm animation needs multiple views to convey lots of information

54 ;;Quote: constant-time lookup by parallel access, multi-level adaptive hashing; rehash when too many hash collisions

59 ;;Quote: animations depend on input data; use small amounts for introduction and large amounts for intuitive understanding

59 ;;Quote: push an algorithm animation with pathological data; e.g. regular polygons revealed a subtle bug

59 ;;Quote: for an animation, a regular arrangement can reveal an algorithm's structure

59 ;;Quote: multi-level adaptive hashing is so effective that needed to design a bad input for the animation

60 ;;Quote: color requires fewer pixels than shape; also better for global patterns in an animation

60 ;;Quote: highlighting with transparent color useful in an animation; use for transient computations

60 ;;Quote: highlight by flipping a reserved bit in color table indices

60 ;;Quote: use the same color to tie together corresponding features in multiple views

61 ;;Quote: sound is harder to use than color in a user interface

62 ;;Quote: audio is useful for signaling exceptional conditions; e.g., computer beeps