[ad_1]
Order is O(n^1.5).
O(n) < O(n log n) < O(n^1.5) < O(n^2).
So answer is 4.
[ad_2]
solved Analysis of algorithm and finding its time complexity
[ad_1]
Order is O(n^1.5).
O(n) < O(n log n) < O(n^1.5) < O(n^2).
So answer is 4.
[ad_2]
solved Analysis of algorithm and finding its time complexity