calculate the approximate complexity of Mystery algorithm by

calculate the approximate complexity of Mystery algorithm by filling in the table below (please note that the arra[1..n] can be any values, and it should not affect the complexity caluclations.

Algorithm Mystery (A:array[1. .nl of integer) sum, max integer sum 0 1 2 max 30 3 for i 1 to n Sum for j i to n sum sum A [i] if sum max then. max Sum 9 return max

Solution

Of the given steps, steps having for loop will have O(n) complexity and other will be O(1). And overall complexity of algo. will be O(n^2). Below table gives the time complexity of individual step:

Hope it helps, do give your response.

Step	Big-oh Complexity
1	O(1)
2	O(1)
3	O(n)
4	O(1)
5	O(n)
6	O(1)
7	O(1)
8	O(1)
9	O(1)
Complexity of the Algorithm	O(n*n ) = O(n^2)