See all articles from Timelinez v6 n12
Tutorial explaining linked list data structures for QL SuperBASIC programmers. Covers the concept of pointer-based dynamic ordering, where records store pointers to the next item rather than maintaining physical sort order. Includes a working type-in program demonstrating insertion (handling empty list, front insertion, end insertion, and mid-list insertion) and sorted printout.