Suppose we have three algorithms, and their orders are O(n2), O(2n) and O(log2 n). Arrange these orders in increasing magnitude.
What will be an ideal response?
O(log2 n) < O(n2 ) < O(2n).
Computer Science & Information Technology
You might also like to view...
Which of the following groups is NOT displayed in the audio PLAYBACK tab?
A) Preview B) Bookmarks C) Volume D) Editing
Computer Science & Information Technology
On your own computer you can exit Word, and the building blocks will remain until you delete them
Indicate whether the statement is true or false
Computer Science & Information Technology