What is the Big-O notation that can best describe the following algorithm? pro...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
What is the Big-O notation that can best describe the following algorithm?
procedure Alg1(A): A is a list of n integers
1 m = A[0]
2 for i = 1 to n-1
3 if m < A[i] then
4 m = A[i]
5 end of if
6 end of for
7 return m
100%
0%
0%
0%
Want instant access to all verified answers on online.upr.edu?
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!