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

question 28

Short Answer

find the "best" big-O notation to describe the complexity of the algorithm. Choose your answers from the following: $$1 , \log _ { 2 } n , n , n \log _ { 2 } n , n ^ { 2 } , n ^ { 3 } , \ldots , 2 ^ { n } , n !$$
-A linear search to find the smallest number in a list of n numbers.

---

Definitions:

Straight-Line Depreciation

A practice for dispersing the expense of a concrete asset across its functional life in regular yearly sums.

Working Capital

This denotes a financial metric highlighting a company’s short-term financial health, specifically its ability to cover short-term liabilities with its short-term assets.

Straight-Line Depreciation

A method for distributing the financial commitment of a physical asset over its operational life in uniform yearly figures.

Capital Budgeting

The process by which a business evaluates and selects long-term investments based on their potential to generate net cash flows over time.