In Questions fiNd the "Best" Big-O Notation to Describe the Complexity

Short Answer

In questions 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 !$$
- $$\text { An iterative algorithm to compute } n ! \text {, (counting the number of multiplications). }$$