跳转到主要内容
eLearner.app
模块 2 · 第 2 课(共 4)课程中的6/36~8 min
模块课程(2/4)

while 循环

The while loop repeats a block as long as a condition stays true. Use while when you don't know up front how many iterations you'll need: the number of rounds depends on something that changes inside the loop.

Syntax

Python
n = 1
while n < 1000:
    n = n * 2
n  # 1024

The indented block is executed repeatedly. Before each iteration Python evaluates the condition: as soon as it becomes false, the loop terminates and execution continues after the block.

Common patterns

Manual counter — equivalent to a classic for in other languages:

Python
i = 0
while i < 5:
    print(i)
    i = i + 1

Infinite loop + internal exit condition — useful when the condition is evaluated after doing something:

Python
acc = 0
while True:
    acc = acc + 1
    if acc * acc > 100:
        break
acc  # 11   (11*11 = 121 is the first square > 100)

break exits immediately from the innermost loop (we'll see it in the next lesson).

The classic mistake: the infinite loop

If the variable in the condition does not change inside the loop, the program never terminates. It is the number-one bug with while:

Python
n = 0
while n < 10:
    print(n)   # n is never modified → infinite loop!

In our exercises there is an execution timeout, so an infinite loop will fail with a clear message instead of freezing the browser. But in production an infinite loop is a serious bug.

Infinite loops risk and termination conditions

A while loop executes as long as its condition evaluates to True. If you forget to update the variables that affect the condition, your loop will run infinitely, freezing the runtime. Always ensure that the loop body makes progress towards the exit condition.

Try it yourself

锻炼#python.m2.l2.e1
尝试:0加载中...

Find the smallest integer `n >= 1` such that 2**n exceeds one million. Assign it to `result` and evaluate it (it should be 20).

正在加载编辑器...
显示提示

2**20 = 1,048,576 is the first to exceed 1,000,000.

3 次尝试后可用的解决方案

Review exercise

锻炼#python.m2.l2.e2
尝试:0加载中...

Starting from `n = 1000`, halve n with integer division (n // 2) until it becomes 0. Count how many iterations it takes in `steps`. Evaluate `steps`.

正在加载编辑器...
显示提示

1000 → 500 → 250 → 125 → 62 → 31 → 15 → 7 → 3 → 1 → 0: ten steps.

3 次尝试后可用的解决方案

Additional challenge

锻炼#python.m2.l2.e3
尝试:0加载中...

Given the variable `n = 32`, write a `while` loop to count how many times you can divide `n` by 2 (using floor division `//`) before `n` becomes less than or equal to 1. Store the count in `divisions` and evaluate it.

正在加载编辑器...
显示提示

The while condition is n > 1. Inside the loop, divide n by 2 and increment divisions by 1.

3 次尝试后可用的解决方案