What is linear search characterized by?

Linear search is characterized by the process of examining each item in a list sequentially until the desired target value is located. This method involves starting from the beginning of the list and checking each element one after the other until either the target is found or the end of the list is reached.

This approach is straightforward and intuitive, making it easy to implement. It does not rely on the data being in any specific order, which distinguishes it from other searching algorithms such as binary search that require a sorted list to function effectively. Thus, this method is particularly useful when dealing with unsorted data.

The other options refer to different characteristics of searching techniques: searching through a sorted list pertains more to binary search or similar algorithms, finding an item in constant time describes an ideal scenario often associated with hash tables, and halving the search space with each iteration aligns with the operational principle of binary search. Hence, the essence of linear search is all about sequentially checking each item until the search is complete.