What am I: Looking for a number in an list of numbers one by one until I find the number

A linear search, also known as a sequential search, checks each element of a list one by one in order until a match is found or the end of the list is reached. Binary search requires a sorted list and divides the search interval in half each time, which is much faster but works differently. Other options like singular search or bubble search are not standard search algorithms.