The sequential search algorithm uses a(n) variable to track whether the item is found.

A sequential search algorithm uses a Boolean value to indicate when an item is found. A Boolean value can have a value of either true or false. Sequential searches are implemented in computer programming. Sequential search is simple to implement, but is much slower that other types of search algorithms because it searches each item in the set until it finds a specific value.