Chapter 5. Conditionals and Recursion
The main topic of this chapter is the if statement, which executes different code depending on the state of the program. With the if statement we’ll be able to explore one of the most powerful ideas in computing, recursion.
But we’ll start with three new features: the modulus operator, boolean expressions, and logical operators.
Integer Division and Modulus
Recall that the integer division operator, //, divides two numbers and rounds down to an integer. For example, suppose the runtime of a movie is 105 minutes. You might want to know how long that is in hours. Conventional division returns a floating-point number:
minutes=105minutes/60
1.75
But we don’t normally write hours with decimal points. Integer division returns the integer number of hours, rounding down:
minutes=105hours=minutes//60hours
1
To get the remainder, you could subtract off one hour, in minutes:
remainder=minutes-hours*60remainder
45
Or you could use the modulus operator, %, which divides two numbers and returns the remainder:
remainder=minutes%60remainder
45
The modulus operator is more useful than it might seem. For example, it can check whether one number is divisible by another: if x % y is zero, then x is divisible by y.
Also, it can extract the rightmost digit or digits from a number. For example, x % 10 yields the rightmost digit of x (in base 10). Similarly, x % 100 yields the last two digits.
x=123x%10,x%100
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access