What Will Be The Time Complexity Of The Following Codep Pre #407

What will be the time complexity of the following code?</p> <pre><code class="language-c"> #include <bits/stdc++.h> 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; } </code></pre>

This multiple choice question (MCQ) is related to the book/course gs gs121 Data Structures and Algorithms. It can also be found in gs gs121 Array Types - Reversal Array Operation - Quiz No.1.

 #include <bits/stdc++.h> 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; }