engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Algorithms Algorithm Design Techniques Divide and Conquer
Given a sorted array of distinct integers A[1..n], you want to find out whether there is an index ‘i’ for which A[i] = i . If this problem is solved using divide & conquer method, then the algorithm runs in__
1
Θ(n)
2
Θ(n log n)
3
Θ(log n)
4
Θ(n2)