Explanation:
Module getNumber (Integer Ref Value)
Display "Display a number"
Input number
End module
Module main ()
Declare Integer number x = 1
Declare Real number y = 2.5
Display( x, " " ,y)
Call changeUS (x,y)
Display( x, " " ,y)
End module
Answer:
D. O(NlogN)
Explanation:
The computation of the overall algorithm cost is as follows:
Given that
O(logN) + O(N) × O(logN) + 1
In the case of complexity we considered the high order that dominates the other terms
Thus, that term would be
O(N) × O(logN)
It could be rewrite as
O(NlogN)
Hence, the correct option is D.
All the other options are wrong
