Question

How does Sequential Search work?

1) Starts at first element and goes up until it finds the "key" or if the list is sorted in ascending order, continues until the "key" is less than the current element
2) If a list is sorted in ascending order, split list in half then if the key is not in the middle element, if the element is less than the middle call the method for the left or if the element is more call the method for the right. If there is cross between high and low, then the element is not in the list

Answer 1

Sequential Search is a basic search algorithm that compares each element in a list to a desired element until a match is found or the end of the list is reached. If the list is sorted, binary search can be used to divide the list and narrow the search space.

Step-by-step explanation:

Sequential Search is a simple search algorithm used to find an element in a list of items. It works by checking each element in the list, one by one, until the desired element is found or until the end of the list is reached.

If the list is not sorted, the algorithm starts at the first element and compares it with the desired element (key) until a match is found or the end of the list is reached. This process continues until a match is found or the end is reached.

If the list is sorted in ascending order, the algorithm can use a technique called binary search. In this case, the algorithm first divides the list in half and checks if the middle element is the desired element. If not, it determines whether to search the left or right half of the list based on the comparison between the middle element and the desired element. This process continues until a match is found or the search boundaries cross each other.