Question

What is the algorithm for linear search

Answer 1

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.

Worst complexity: O(n)

Average complexity: O(n)

Space complexity: O(1)

Worst-case space complexity: O(1) iterative

Average performance: O(n/2)

Class: Search algorithm

Explanation:

hope it's helpful

make me brainlliest answer

Answer 2

Answer:

Linear search is a very simple search algorithm. In this type of search, a sequential search is made over all items one by one. Every item is checked and if a match is found then that particular item is returned, otherwise the search continues till the end of the data collection.