Final answer:
Sequential pattern search involves examining each element in a sequence until a match is found or the end is reached. Its efficiency is O(n), where n is the number of elements in the sequence.
Step-by-step explanation:
The logic behind sequential pattern search involves examining each element in a list or sequence one by one until a match is found or the end of the sequence is reached.
This is typically done using a loop that iterates through the sequence and compares each element with the target element being searched for.
The efficiency of sequential pattern search is O(n), where n is the number of elements in the sequence. This means that the time it takes to find a match increases linearly with the size of the sequence.