CUET PG 2021 — Computer PYQ

Solving: Array Operations Complexity

Sorted array mein elements ek fix order mein hote hain, jiska asar unhe dhoondhne ya badalne ki speed par padta hai.

1. Accessing an element ($O(1)$):

Array ke kisi bhi index ($i$) ki value direct nikalna constant time leta hai kyunki memory address seedha calculate ho jata hai.

2. Finding Min/Max ($O(1)$):

Sorted array mein minimum hamesha pehla element ($A[0]$) aur maximum hamesha aakhri element ($A[n-1]$) hota hai.

3. Searching an element ($O(\log n)$):

Sorted data mein hum Binary Search use karte hain, jo har step par search area ko aadha ($1/2$) kar deta hai.

Isliye, Search $O(1)$ nahi hai.

4. Deleting/Inserting an element ($O(n)$):

Agar aap koi element delete karte hain, toh baaki saare elements ko shift karna padta hai taaki order maintain rahe.

Complexity Table

Operation	Time Complexity	O(1) hai ya nahi?
Access ($i^{th}$ element)	$O(1)$	Haan
Find Min/Max	$O(1)$	Haan
Search (Binary)	$O(\log n)$	Nahi
Search (Linear)	$O(n)$	Nahi
Insertion/Deletion	$O(n)$	Nahi

Final Answer

Searching (Khojna) ya Insertion/Deletion sorted array ke liye $O(1)$ nahi hote. Options ke mutabik, Search ($O(\log n)$) iska sahi jawab hoga.