Computer Science, asked by mohitsingh628229, 4 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

Science, 2 months ago

1)What is Ionisation Protocol? 2)What is the Ionisation energy of carbon(in kJ/mol)? ⬆️⬆️Questions ⬆️⬆️ Book :- Selina Concise Chemistry Chapter :- 1 (Periodic Table ,Periodic properties) Class :- 10...

Math, 2 months ago

find the TSA and volume of a cone when radius is 7 cm slant height is 10 cm (with steps)...

Science, 2 months ago

please tell me this answer if u like this question please mark me as brainliest...

Math, 4 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 ) ...