Question: Please select the tight time complexity of the following function in worst case. sum(A, n) { flag = true while(flag) { for i=1 to (n/2)

 Please select the tight time complexity of the following function in

Please select the tight time complexity of the following function in worst case. sum(A, n) { flag = true while(flag) { for i=1 to (n/2) for j= n down to i if A[i] = A[j] flag = false break } } B.O(n) C. O(n) O A. O(n3) D. O(n log n)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!