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:

Union Organizing Campaign

A coordinated effort aimed at convincing workers to join or form a union to negotiate collectively with their employer.

Organizations

Groups of people who work together in an organized way for a shared purpose.

Wagner Act

A foundational statute in United States labor law which guarantees basic rights of private sector employees to organize into trade unions, engage in collective bargaining, and take collective action such as strikes.

Taft-Hartley Act

A United States federal law that restricts the activities and power of labor unions.