Question: Devise algorithms to solve each of the following problems. Write each algorithm in pseudocode. Given a positive integer, n, find the smallest power of 10
Devise algorithms to solve each of the following problems. Write each algorithm in pseudocode.
Given a positive integer, n, find the smallest power of 10 that is greater than or equal to n. For example, if n were 8 your algorithm would return 10, if n were 17 your algorithm would return 100, if n were 100 your algorithm would also return 100, etc.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
