Computer Science, asked by mohitsingh628229, 5 months ago

The complexity of linear search algorithm is

Answers

Answered by Anonymous

Answer:

The worst case complexity of linear search is O(n). Explanation: The compexity of binary search is O(logn). Explanation: The worst case complexity for merge sort is O(nlogn). Explanation: The worst case complexity for Bubble sort is O(n2) and best case is O(n)

Explanation:

Previous Question

Next Question

Similar questions

English, 2 months ago

extract why fo you take away his sources of entertainment a)who is you refer to...

Chemistry, 2 months ago

What do you mean by Olfactory indicators ?

Math, 2 months ago

Colby and Jaquan are growing bacteria in an experiment in a laboratory. Colby starts with 50 bacteria in his culture and the number of bacteria doubles every 2 hours. Jaquan has a different type of bacteria that doubles every 3 hours. How many bacteria should Jaquan start with so that they have the same amount at the end of the day?

Math, 5 months ago

Please solve this question In figure 30 RT = RS , angle AQR = 2× angle BRS and Angle BOS = 2 × angle ASR. Prove that triangle RBT = triangle SAT . ( Hint : Prove that angle BRS = angle ASR ) ...