1. Write an algorithm to find gcd(m,n). Please use for/while loop and variables to write the algorithm. 4. Arrange the
Posted: Mon Jul 11, 2022 9:51 am
4. Arrange the following based on order of growth. Best ....to.... Worst. (For example: constant is best) n³, log n, n, n², n!, 1, 2¹, n log n