engineering recuitment GATE CSE 2023-24 Test Series Algorithms Algorithm Design Techniques Divide and Conquer
Consider a 2-D array of order n x n.
a[n][n] = {{11, 10, 9}; {8, 25, 17}; {5, 21, 20}}
Which of the following algorithm design technique is used to find a peak element in a given array where peak element is an element which is greater than or equal to its four neighbors, left, right, top and bottom.
1
Greedy approach
2
Divide and conquer method
3
dynamic programming
4
brute force method