For the following algorithm:[Q1 multi]What is the time complexity in the worst case? ALGORITHM XYZ (A,...

Transcribed Image Text:

For the following algorithm:[Q1 multi]What is the time complexity in the worst case? ALGORITHM XYZ (A, n) // Input: An array of n elements sum = 0 for c = 1 to 1000 do if A[c] < 0 then for k=1 to n do sum = sum + k. A[c] return sum O a. 0(1) O b. O(n^2) O c. 0(1000 n) O d. O(n) O e. None For the following algorithm:[Q1 multi]What is the time complexity in the worst case? ALGORITHM XYZ (A, n) // Input: An array of n elements sum = 0 for c = 1 to 1000 do if A[c] < 0 then for k=1 to n do sum = sum + k. A[c] return sum O a. 0(1) O b. O(n^2) O c. 0(1000 n) O d. O(n) O e. None

Answer rating: 100% (QA)

The detailed answer for the above question is provided below The provided algorithm XYZ involves two ... View the full answer