This final tutorial in the Data structures and algorithms series introduces searching and sorting with doubly-linked lists and circular-linked lists.

Like arrays, which were introduced in Part 3 of this tutorial series, linked lists are a fundamental data structure category upon which more complex data structures can be based.

In Section 8, the use of latent structure linear regression is discussed. It is shown that the latent structure methods much more quickly arrive at the final solution than forward variable selection.