Context Navigation

intro.tex

Timestamp:

Apr 28, 2026, 8:56:08 AM (14 hours ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

master

Parents:

bf8112b

Message:

spelling corrections, and final proofreading

File:

rbf8112b	r5faa3a5
71	71	Among the linked structures, the list's defining characteristic is maintaining a user-explicit total order (chain shape).
72	72	Element search can be by position (as for array) or by value; it is sometimes presented as a subscript.
73		In a more complex structure, the linked shape may be system managed (user impicit) by being a function of a designated ``key'' datum, \eg often for a hash table.
	73	In a more complex structure, the linked shape may be system managed (user implicit) by being a function of a designated ``key'' datum, \eg often for a hash table.
74	74	Though such schemes often give better-than-$O(n)$ lookup, the linked list's user-explicit shape limits what the system can provide, to fast step/iteration for user-``nearby'' data, and slow exhaustive search/seek otherwise.
75	75	Linked types are dynamically sized by adding and removing nodes using link fields internal or external to the list elements (nodes).

Note: See TracChangeset for help on using the changeset viewer.