Q86
What will be the time complexity of the following code? #include using namespace std; void func(int arr[], int left, int right) if (left >= right) return; int temp = arr[left]; arr[left] = arr[right]; arr[right] = temp; func(arr, left + 1, right - 1); void printArray(int arr[], int size) for (int i = 0; i < size; i++) cout << arr[i] << " "; int main() int arr[] = 1,2,3,4; int n = sizeof(arr) / sizeof(arr[0]); func(arr, 0, n-1); printArray(arr, n); return 0;
A.
O(1)
B.
O(n)
AnswerC.
O(log n)
D.
O(n log n)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board