- Help Needed Asap 1 (9.72 KiB) Viewed 8 times
help needed asap
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
help needed asap
help needed asap
procedure function(a1,..., O(n) O 0(1) O O(n²) a real numbers with n ≥2) O(logn) for i:=1 to n - 1 forj:=1 to n - i if a; > a; + 1 then interchange a; and a; + 1 What is the worst-case scenario time complexity of this algorithm? {a₁ an is in increasing order}
procedure function(a1,..., O(n) O 0(1) O O(n²) a real numbers with n ≥2) O(logn) for i:=1 to n - 1 forj:=1 to n - i if a; > a; + 1 then interchange a; and a; + 1 What is the worst-case scenario time complexity of this algorithm? {a₁ an is in increasing order}