Home / MCQ Bank / Computer

Computer Arrays In Data Structures Difficulty: Medium

What will be the worst case time complexity of the following code? #include <bits/stdc++.h> using namespace std; void func(int arr[], int n) { int count[n]; memset(count, 0, sizeof(count)); for (int i=n-2; i>=0; i--) { if (arr[i] >= n - i - 1) count[i]++; for (int j=i+1; j < n-1 && j <= arr[i] + i; j++) if (count[j] != -1) count[i] += count[j]; if (count[i] == 0) count[i] = -1; } for (int i=0; i<n; i++) cout << count[i] << " "; } int main() { int arr[] = {1, 3, 5, 8, 9}; int n = sizeof(arr) / sizeof(arr[0]); func(arr, n); return 0; }

Select the correct option to test your answer:

More Computer Questions

Which of the following is preferred for text analytics? Which of the following is an alternate name of MSD radix sort? What will be the output of the following Python code? x = 5 def f1(): global x x = 4 def f2(a,b): global x return a+b+x f1() total = f2(1,2) print(total) In which of the following does a Directed Acyclic Word Graph finds its application in? What is HBase in the context of Hadoop?