# Data structure - What is sequential search? What is the average number of comparisons in a sequential search?

## What is sequential search? What is the average number of comparisons in a sequential search?

Sequential search searches for elements in an array sequentially until the element is found. The average number of comparisons can be n+1/2.

## What is sequential search? What is the average number of comparisons in a sequential search?

Sequential search: Searching an element in an array, the search starts from the first element till the last element.

The average number of comparisons in a sequential search is (N+1)/2 where N is the size of the array. If the element is in the 1st position, the number of comparisons will be 1 and if the element is in the last position, the number of comparisons will be N.
Data structure - What is binary searching and Fibonacci search?
Binary searching and Fibonacci search - Binary Search: Binary search is the process of locating an element in a sorted list. The search starts by dividing the list into two parts........
36 Embedded Systems Interview Questions and Answer
Embedded systems interview questions - What is the need for an infinite loop in Embedded systems?, What is the need for DMAC in ES?, How are macros different from inline functions? etc.