Q: Advantages and disvantages of linear search?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

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

this is dumb

ADVANTAGES Shows relationship between two variables best method to illustrate a non-linear pattern.

A system of linear inequalities give you a set of answers that could work. In day to day lives we actually use linear inequalities all the time. We are given questions and problems where we search for a number of possible solutions.

Finding help for elementary linear algebra is quite simple, one can find such helpful text books on the subject in question in a local Library. Also if you have a basic computer skills you may be able to search a few websites that may give you an introduction to elementary linear algebra.

Related questions

what are the disvantages of animal extinction

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.

Eustress motivates. High level of stress over long period causes distress.

advantages and disadvantages of linear model communication

Disadvantages:- 1. Expensive 2. Small learner to trainer ratio. 3. Duplicates the production line.

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.

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

If the data is sorted and every element is directly accessible, then you can perform binary search (see built-in function bsearch), otherwise you have to do linear search (which is slower).

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

advantages and disadvantages of linear model communication

Running time of a linear search is O(n)

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