8. For the following questions, find the best big-O notation to describe the complexity of the...

 

Transcribed Image Text:

8. For the following questions, find the best big-O notation to describe the complexity of the algorithm. Choose your answers from the following: 1, log2 (n), n, n log (n), n, n,..., 2n, n!. (a) An algorithm that prints all bit strings of length n. [10 points] (b) An iterative algorithm to compute n!, (counting the number of multiplications). [10 points] 8. For the following questions, find the best big-O notation to describe the complexity of the algorithm. Choose your answers from the following: 1, log2 (n), n, n log (n), n, n,..., 2n, n!. (a) An algorithm that prints all bit strings of length n. [10 points] (b) An iterative algorithm to compute n!, (counting the number of multiplications). [10 points]