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

Social Sciences, 1 month ago

Fold mountains are created due to_______ process of Earth...

Accountancy, 1 month ago

started business with case rs10,000 (2)goods sol for cash rs 2,000(3) bought goods from sham rs 1,000(4) purchased goods for cash rs 3,000 (5)good sold for case rs 2,000 (6)bought farnoture for cash rs 3,000(7) paid bazis for cash rs 1,000(8) cash paid to sham rs 2,500...

Math, 1 month ago

a shopkeeper sold 45 cycle at the cost of 900each and 70 scooter at the cost of 25.000 each what amount did he get from the sale of these items...

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