2. Find the worst-case time complexity of the OpenMystery algorithm below. Input: n: positive integer 1...

 

Transcribed Image Text:

2. Find the worst-case time complexity of the OpenMystery algorithm below. Input: n: positive integer 1 Algorithm: OpenMystery 2 Let open be a Boolean array of size n 3 Initialize open to false 4 nopen = 0 5 for 1 to n do 6 j = 7 8 while jn do if open[j] then 9 nopen nopen - 1 10 else 11 |nopen = nopen +1 12 13 14 end open [j] = open [j] j = j + i 15 end 16 end 17 return nopen 2. Find the worst-case time complexity of the OpenMystery algorithm below. Input: n: positive integer 1 Algorithm: OpenMystery 2 Let open be a Boolean array of size n 3 Initialize open to false 4 nopen = 0 5 for 1 to n do 6 j = 7 8 while jn do if open[j] then 9 nopen nopen - 1 10 else 11 |nopen = nopen +1 12 13 14 end open [j] = open [j] j = j + i 15 end 16 end 17 return nopen

Answer rating: 100% (QA)

To find the worstcase time complexity of the OpenMystery algorithm we need to analyze the number of ... View the full answer