The simplest technique for finding an element in a data collection is to use a linear search. It checks each element until it finds a match, from the beginning to the end of the data collection. Once the target element has been found, the search is completed and ended.
The space complexity of linear search is constant, i.e. O(1), because no important additional memory is used.