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:

Paid

The act of transferring money or compensation for services rendered or goods received.

Trade Discount

A reduction from the list price granted by a seller to a buyer in the commercial marketplace, often based on volume or trade status.

Net Price

The price of a good or service after deductions such as discounts, rebates, and allowances have been taken into account.

List Price

The manufacturer's suggested retail price (MSRP) or the price at which a product is intended to be sold before any discounts or promotions.