CUET PG 2026 — Computer PYQCUET PG | Computer | 2026Arrange the following in increasing time complexity.Ask AI TutorChoose the correct answer:A. Linear search worst caseB. binary search best case (Correct Answer)C. Quick sort expected running timeD. bubble sort worst caseCorrect Answer: binary search best caseExplanationSolution 1. Binary search best case: O(1) 2. Linear search worst case: O(n) 3. Quick sort expected running time: O(nlogn) 4. Bubble sort worst case: O(n2) Comparison O(1) < O(n) < O(n \log n) < O(n^2) Conclusion The increasing order is: (b), (a), (c), (d)ALinear search worst caseBbinary search best caseCQuick sort expected running timeDbubble sort worst caseShow Answer SExplanationSolution 1. Binary search best case: O(1) 2. Linear search worst case: O(n) 3. Quick sort expected running time: O(nlogn) 4. Bubble sort worst case: O(n2) Comparison O(1) < O(n) < O(n \log n) < O(n^2) Conclusion The increasing order is: (b), (a), (c), (d)
