While loops #

In addition to for loops which run for a set number of iterations, Python has another type of loop. while loops iterate until a particular condition is met.

[0] Set up #

cd ~/desktop/making_with_code/unit00_drawing/

git clone https://github.com/the-isf-academy/lab_while.git

cd lab_while

💻 Enter the Poetry Shell to start the lab. As a reminder, we will run this command at the start of each lab, but only when we are inside a lab folder.

poetry shell

👾 💬 Exiting the poetry shell

When you want to exit the shell, you can type exit or ^D

💻 Take a look at the files inside with: ls

• guessing_game.py
• hailstone_sequence.py

[1] What is a While Loop? #

while loops use conditions just like if statements. You can use operators to compare values or to generate True or False conditions. Looping until a condition is met can be useful when you are getting input from a user, generating random variables, or repeatedly changing a value.

user_input = -1
while user_input < 1 or user_input > 10:
    user_input = int(input("Tell me a number between 1-10 (inclusive): "))

[2] Guessing Game #

One common usage of while loops is in games. In this first part of the lab, you will be using a while loop to create a number guessing game.

python guessing_game.py

----------------------------
Guess a number between 1-10!
----------------------------

Guess a number: 5
Guess a number: 10
Guess a number: 3
Correct
Guess a number: 8
Guess a number:

It works! But, even after you guess the correct number, the game continues. It’s up to you to fix the code!

👾 💬 Stopping a program

When you want to stop running a program, type ^C in the terminal.

code guessing_game.py

👾 The final game should like something like this:

----------------------------
Guess a number between 1-10!
----------------------------

Guess a number: 5
Too high...
Guess a number: 3
Too high...
Guess a number: 2
Correct

[3] Hailstone Sequence #

Now that you’ve gotten practice with while loops, you will be exploring a special sequence known as the hailstone sequence.

This sequence results from the following rules (known as the Collatz conjecture):

• take any positive number n
• find the next term of the sequence using the following rules:
  • if n is even, the next term is n/2
  • if n is odd, the next term is n*3+1
• repeat until n = 1

The conjecture states that no matter the starting value of n, the sequences will always reach 1.

This sequence is interesting because though no number has ever been found that doesn’t reach 1,the Collatz conjecture has never been proven. This is an unsolved problem in mathematics!

Pseudocode the Sequence #

This is another algorithm which will require pseudocode to figure out.

✔️ Your program must:

0. Ask the user what number the program should calculate the hailstone sequence of.
1. Print out each number in the sequence.
2. Print out how many steps it took for the sequence to reach 1

🤔 Here are some things to consider:

• This program will require a loop. What kind of loop do you think is best?
  • Remember that for loops run for a definite number of times and while loops run until a condition is met.
• You will need to determine if each term is odd or even.
  • What are some characteristics of even numbers that will help you determine if a number is even?
• In addition to calculating each term, you must count how many steps it takes to reach 1 and report this number at the end.

💻 To get started, open up hailstone_sequence.py.

code hailstone_sequence.py

Use comments to complete the pseudocode to find the hailstone sequence of any starting number. There are currently three lines of pseudocode in the file.

A comment is any line that starts with a #

# this is a comment

You can comment code quickly by highlightly multiple lines and clicking ⌘+? - this will comment or uncomment code.

Code the Sequence #

💻 Translate your pseudocode into Python code. Once completed, your program will look something like this:

--- Hailstone Sequence ---

Input a starting number: 21
64
32
16
8
4
2
1
It took 7 steps to complete the sequence

[4] Deliverables #

⚡✨

Once you’ve successfully completed the sequence be sure to fill out this Google form.

✏️ Add a piece of your code and a screenshot to the CS Year 1 Code Log in your Google Drive. Add a comment. You can:

• ask a question about your code
• write a tip to your future self
• explain a bug you fixed in your code
• describe a piece of code you are proud of

[5] Extension: Visualizing the Sequence #

The sequences you formed above are known as hailstone sequences, because the terms move up and down but ultimately reach 1 like hailstones gaining layers of ice in a cloud.

This pattern can lead to some interesting visualizations of hailstone sequences.

You can visualize the terms in a sequence starting with a specific number:

Or you can visualize the number of steps it takes to reach one from a set of integers:

You will need to reference the following:

• Turtle Color Documentation
• Python Random Library Documentation

At the top of the file, you must to change the color mode to 255.

colormode(255)

You can then use the RGB color system. For example color(0,0,255) is pure blue.

color(0,0,255)