Question

Example of linear search in data structure ​

Answer 1

Answer:

$\small\fbox\purple{Answer}$

In computer science, a linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched.

Answer 2

✩ Answer ✩

❍ Linear Search Example-

Linear Search algorithm compares element 15 with all the elements of the array one by one. It continues searching until either the element 15 is found or all the elements are searched.

I HOPE ITS HELP YOU