chained list search; linked list search
A computing term for searching through a linked list data structure. Used in algorithm descriptions and technical documentation.
The time complexity of a linked list search is proportional to the number of elements.
This algorithm speeds up linked list searches.
Linear search is a general term for sequentially checking each element; 連結リスト探索 specifically refers to searching within a linked list data structure.
Binary search requires random access and is not directly applicable to linked lists; 連結リスト探索 typically uses sequential access.
Compound of 連結 (linking) + リスト (list) + 探索 (search), a direct calque from English 'linked list search'.