Vidyalelo
Data Structure · Q133

Arrays in Data Structures

Programming · Data Structure · question 133

Q133

What will be the time complexity of the following code? #include using namespace std; void func1(int arr[], int n) int k = arr[0], i; for (i = 0; i < n - 1; i++) arr[i] = arr[i + 1]; arr[i] = k; void func(int arr[], int d, int n) for (int i = 0; i < d; i++) func1(arr, n); void printArray(int arr[], int n) for (int i = 0; i < n; i++) cout << arr[i] << " "; int main() int arr[] = 1, 2, 3, 4, 5; int n = sizeof(arr) / sizeof(arr[0]); int d = 3; func(arr, d, n); printArray(arr, n); return 0;

A.
O(n*d)
Answer
B.
O(n)
C.
O(d)
D.
O(n2)

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board