What Will Be The Auxiliary Space Complexity Of The Following #387

What will be the auxiliary space complexity of the following code?</p> <pre><code class="language-c"> #include <iostream> using namespace std; int main() { int arr[] = {1,2,3,4,5,6}; int n = sizeof(arr)/sizeof(arr[0]); int d=4; int temp[10]; for(int i=0;i<d;i++) temp[i]=arr[i]; int j=0; for(int i=d;i<n;i++,j++) arr[j]=arr[i]; int k=0; for(int i=n-d;i<n;i++,k++) arr[i]=temp[k]; for(int i=0;i<n;i++) cout<<arr[i]<<" "; 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 - Rotation Array Operation - Quiz No.1.

 #include <iostream> using namespace std; int main() { int arr[] = {1,2,3,4,5,6}; int n = sizeof(arr)/sizeof(arr[0]); int d=4; int temp[10];  for(int i=0;i<d;i++) temp[i]=arr[i];  int j=0; for(int i=d;i<n;i++,j++) arr[j]=arr[i];  int k=0; for(int i=n-d;i<n;i++,k++) arr[i]=temp[k];  for(int i=0;i<n;i++) cout<<arr[i]<<" "; return 0; }