Donald Knuth [k-nooth] makes one variety of them "dance" in an algorithm for solving pentomino puzzles and the n-queens problem. Their "unrolled" variety contains arrays of elements and their "skip" type allows large numbers of elements to be ignored, improving their linear indexing time. Often containing data-less "sentinels" at their beginning an
Donald Knuth [k-nooth] makes one variety of them "dance" in an algorithm for solving pentomino puzzles and the n-queens problem. Their "unrolled" variety contains arrays of elements and their "skip" type allows large numbers of elements to be ignored, improving their linear indexing time. Often containing data-less "sentinels" at their beginning and end, they were created by Simon, Newell, and Shaw for the Information Processing Language, and their representation as blocks and arrows won the latter two a Turing Award. For 10 points, name this data structure in which each data node contains a pointer to the subsequent data node.
Donald Knuth [k-nooth] makes one variety of them "dance" in an algorithm for solving pentomino puzzles and the n-queens problem.
{linked list} [accept {chained list}]