DAY 50 OF 90 · Know when to stop

Halving steps

Easy90 Days of Looping

Inputs

n is a whole number from 0 to 100,000.

Your tasks

Create a number steps that starts at 0 and a copy rest of n.
Use a while loop that runs while rest is more than 0. Each round, halve rest (rounded down) and add 1 to steps.
Complete halvingSteps so it returns steps. Return it, do not print it.

Example

With n = 20, halvingSteps returns 5.

Rules

If n is 0, return 0.

Test data

TEST DATA 1: n is 20

TEST DATA 2: n is 0

Practice focus

While loops and early exits, for when you don't know how many rounds you need. Binary search, the Euclidean algorithm and graph search are all while loops with a clear stopping rule.

Day 49 Day 51 All 90 days