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

question 9

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 !$$
-An iterative algorithm to compute n!, (counting the number of multiplications)

---

Definitions:

Inventory On Credit

A business practice where goods are acquired without immediate payment, with the understanding that payment will be made at a later date.

Receivables Balance

The total amount of money owed to a company for goods or services delivered or used but not yet paid for by customers.

Average Daily Sales

The average sales generated per day over a specific period, useful for analyzing business performance.

Average Collection Period

The average amount of time it takes for a company to receive payments owed by its customers, indicating the efficiency of the company's credit and collection policies.