Best Answer

Sequential search of an object with in an array of objects is called as linear search.

Study guides

☆☆

Q: Explain linear search with an example?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

Linear means to the first degree. (variables are to the first power only) For example, a linear equation: Ax+B=C or 5x+2=12

a URL is the destination of a webpage and is identifiable by the code you type in to view a webpage, for example www.google.com is the URL code for the Google Search Site

Linear equations have a variable only to the first degree(something to the power of 1). For example: 2x + 1 = 5 , 4y - 95 = 3y are linear equations. Non-linear equation have a variable that has a second degree or greater. For example: x2 + 3 = 19, 3x3 - 10 = 14 are non-linear equations.

dual space W* of W can naturally identified with linear functionals

A linear scale is a scale with equal divisions for equal vales, for example a ruler. A non linear scale is where the relationship between the variables is not directly proportional.

Related questions

Linear SearchBinary Search

The linear search algorithm is a special case of the brute force search.

There no advantages to linear search other than searching for the first (or last) nodes. Linear search takes linear time with an average O(n/2) for each search.

The linear search algorithm is a special case of the brute force search.

explain advantages and disadvantages of linear sequencial model?

There no advantages to linear search other than searching for the first (or last) nodes. Linear search takes linear time with an average O(n/2) for each search.

Running time of a linear search is O(n)

When binary search is not possible. For example: unsorted data, data with variable length, only sequentially accessible data (tape).

the compexity of linear search in worst case is f(n) = n+1

It are the speed.

A binary search runs in O(log n) time, compared to linear search's O(n) time. What this means is that the more elements are present in the search array, the faster a binary search will be (on average) compared to a linear search. As an example, given 100 elements, a binary search will discover the item using no more than 7 iterations, while a linear search will require up to 100 iterations; going to up 1000 elements requires only up to 10 iterations, compared to linear search's 1000 maximum iterations. The downside to binary search, however, is that it only operates on a sorted array, which means the data must be pre-sorted using some means.

1)in linear search it needs more space and time complexity. 2) in linear search if the key element is the last element and the search is from first element that is a worst case, or if the key element is the first element and the search is from last element then also is the worst case.

People also asked

Featured Questions