Examlex

Solved

fiNd the "Best" Big-O Notation to Describe the Complexity of the Algorithm

question 52

Short Answer

find the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: 1,log2n,n,nlog2n,n2,n3,,2n,n!1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !
-A binary search of n elements.


Definitions:

Cheques Presented

Refers to the cheques that have been submitted to a bank for payment and are pending clearance.

Money Market Account

A type of savings account that typically offers higher interest rates, with some restrictions on withdrawal.

Cash Surplus

The amount of cash that exceeds the cash needs of a company, indicating a positive financial state with excess liquidity.

Major Expenditure

A significant financial outlay, often relating to the purchase of fixed assets, long-term investments, or other large-scale business expenses.

Related Questions