Question

6. Which of the following best describes the runtime complexity of the following scenario: A person has to put n tent stakes into the ground. The tent stakes are to be placed 1 meter apart. Each step in this process involves walking 1 meter and driving a stake into the ground. Assume that the n stakes are placed in a backpack and carried along the way. The runtime complexity (in terms of the distance walked as a function of the number of stakes) of this algorithm is best described as: a. logarithmic b. linear c. linearithmic d. quadratic 7. Which of the following best describes the runtime complexity of the following scenario: A person has to put n tent stakes into the ground. The tent stakes are to be placed 1 meter apart. Each step in this process involves walking 1 meter and driving a stake into the ground. Assume that the n stakes are heavy, and only one can be carried at a time. The runtime complexity (in terms of the distance walked as a function of the number of stakes) of this algorithm is best described as: a. logarithmic b. linear c. linearithmic d. quadratic

Answer 1

6. Linear, beacuse n stakes increases, distance to walk also increases n times

Option B

--------------------

7.quadratic

Beacuse walking time need n*n times, because to ground each stake need to walk beginning every time for n times to and n times fro.