320 likes | 444 Views
Introduction to Computing Using Python. Execution C ontrol Structures. Conditional Structures Iteration Patterns, Part I Two -Dimensional Lists while Loop Iteration Patterns, Part II. One-way if statement. Introduction to Computing Using Python. if <condition>:
E N D
Introduction to Computing Using Python Execution Control Structures • Conditional Structures • Iteration Patterns, Part I • Two-Dimensional Lists • while Loop • Iteration Patterns, Part II
One-way if statement Introduction to Computing Using Python if <condition>: <indented code block> <non-indented statement> if temp > 86: print('It is hot!') print('Be sure to drink liquids.') print('Goodbye.') if temp > 86: print('It is hot!') print('Be sure to drink liquids.') print('Goodbye.') if temp > 86: print('It is hot!') print('Be sure to drink liquids.') print('Goodbye.') The value of temp is 50. The value of temp is 90. temp > 86: True print('It is hot!') False print('Be sure to drink liquids.') Print('Goodbye.')
Two-way if statement Introduction to Computing Using Python if <condition>: <indented code block 1> else: <indented code block 2> <non-indented statement> if temp > 86: print('It is hot!') print('Be sure to drink liquids.') else: print('It is not hot.') print('Bring a jacket.') print('Goodbye.') if temp > 86: print('It is hot!') print('Be sure to drink liquids.') else: print('It is not hot.') print('Bring a jacket.') print('Goodbye.') if temp > 86: print('It is hot!') print('Be sure to drink liquids.') else: print('It is not hot.') print('Bring a jacket.') print('Goodbye.') The value of temp is 50. The value of temp is 90. temp > 86: False True print('It is not hot!') print('It is hot!') print('Bring a jacket.') print('Be sure to drink liquids.') print('Bring a jacket.')
Multi-way if statement Introduction to Computing Using Python The value of tis 20. The value of tis 90. The value of tis 50. t > 86: def temperature(t): if t > 86: print('It is hot') elift > 32: print('It is cool') else: print('It is freezing’) print('Goodbye') def temperature(t): if t > 86: print('It is hot') elift > 32: print('It is cool') else: print('It is freezing’) print('Goodbye') def temperature(t): if t > 86: print('It is hot') elift > 32: print('It is cool') else: print('It is freezing’) print('Goodbye') def temperature(t): if t > 86: print('It is hot') elift > 32: print('It is cool') else: print('It is freezing’) print('Goodbye') True False t > 32: True print('It is hot') print('It is cool') False print('It is freezing') print('Goodbye')
Ordering of conditions Introduction to Computing Using Python What is the wrong with this re-implementation of temperature()? def temperature(t): if t > 32: print('It is cool') elift > 86: print('It is hot') else: # t <= 32 print('It is freezing') print('Goodbye') def temperature(t): if 86 >= t > 32: print('It is cool') elift > 86: print('It is hot') else: # t <= 32 print('It is freezing') print('Goodbye') The conditions must be mutually exclusive, either explicitly The conditions must be mutually exclusive, either explicitly or implicitly def temperature(t): if t > 86: print('It is hot') elift > 32: # 86 >= t > 32 print('It is cool') else: # t <= 32 print('It is freezing') print('Goodbye')
Exercise Introduction to Computing Using Python • Write function BMI() that: • takes as input a person’s height (in inches) and weight (in pounds) • computes the person’s BMI and prints an assessment, as shown below • The function does not return anything. • The Body Mass Index is the value (weight * 703)/height2. Indexes below 18.5 or above 25.0 are assessed as underweight and overweight, respectively; indexes in between are considered normal. BMI(weight, height): 'prints BMI report’ bmi = weight*703/height**2 if bmi < 18.5: print('Underweight') elifbmi < 25: print('Normal') else: # bmi >= 25 print('Overweight') >>> BMI(190, 75) Normal >>> BMI(140, 75) Underweight >>> BMI(240, 75) Overweight
Iteration Introduction to Computing Using Python for <variable> in <sequence>: <indented code block> <non-indented code block> The general format of a for loop statement is • <indented code block>is executed once for every item in <sequence> • If <sequence>is a string then the items are its characters • (each of which is a one-character string) • If <sequence> is a list then the items are the objects in the list • <non-indented code block>is executed after every item in <sequence> • has been processed • There are different for loop usage patterns
Iteration loop pattern Introduction to Computing Using Python Iterating over every item of an explicit sequence >>> name = 'Apple' >>> for char in name: print(char) >>> name = 'Apple' >>> for char in name: print(char) A p p >>> name = 'Apple' >>> for char in name: print(char) >>> name = 'Apple' >>> for char in name: print(char) A p p l e >>> name = 'Apple' >>> for char in name: print(char) A p p l >>> name = 'Apple' >>> for char in name: print(char) A >>> name = 'Apple' >>> for char in name: print(char) A >>> name = 'Apple' >>> for char in name: print(char) A p >>> name = 'Apple' >>> for char in name: print(char) A p >>> name = 'Apple' >>> for char in name: print(char) A p p >>> name = 'Apple' >>> for char in name: print(char) A p p l name = 'A pple' 'A' char = 'p' char = 'p' char = 'l' char = 'e' char =
Iteration loop pattern Introduction to Computing Using Python Iterating over every item of an explicit sequence for word in ['stop', 'desktop', 'post', 'top']: if 'top' in word: print(word) 'stop' word = 'desktop' word = >>> >>> stop >>> stop desktop top >>> stop desktop top >>> stop desktop >>> stop desktop 'post' word = 'top' word =
Iteration loop pattern Introduction to Computing Using Python • Iterating over every item of an explicit sequence • iterating over the characters of a text file • iterating over the lines of a text file >>> infile = open('test.txt') >>> content = infile.read() >>> for char in content: print(char, end='') >>> infile = open('test.txt') >>> lines = infile.readlines() >>> for line in lines: print(line, end='')
Counter loop pattern Introduction to Computing Using Python Iterating over an implicit sequence of numbers >>> n = 10 >>> for i in range(n): print(i, end=' ') 0 1 2 3 4 5 6 7 8 9 >>> for i in range(7, 100, 17): print(i, end=' ') 7 24 41 58 75 92 This example illustrates the most important application of the counter loop pattern >>> for i in range(len('world')): print(i, end=' ') 0 1 2 3 4
Counter loop pattern Introduction to Computing Using Python Iterating over an implicit sequence of numbers >>> pets = ['cat', 'dog', 'fish', 'bird'] >>> for animal in pets: print(animal, end=' ') cat dog fish bird >>> for i in range(len(pets)): print(pets[i], end=' ') cat dog fish bird 'cat' 0 animal = i= pets[0] is printed 'dog' 1 animal = i= pets[1] is printed 'fish' 2 animal = i= pets[2] is printed 'bird' 3 animal = i= pets[3] is printed
Counter loop pattern Introduction to Computing Using Python Iterating over an implicit sequence of numbers… But why complicate things? Let’s develop function checkSorted()that: • takes a list of comparable items as input • returns True if the sequence is increasing, False otherwise >>> checkSorted([2, 4, 6, 8, 10]) True >>> checkSorted([2, 4, 6, 3, 10]) False >>> Implementation idea: check that adjacent pairs are correctly ordered def checkSorted(lst): 'return True if sequence lst is increasing, False otherwise' def checkSorted(lst): 'return True if sequence lst is increasing, False otherwise' for num in lst: # compare num with next number in list def checkSorted(lst): 'return True if sequence lst is increasing, False otherwise' for i in range(len(lst)-1): # i = 0, 1, 2, ..., len(lst)-2 # compare lst[i] with lst[i+1] def checkSorted(lst): 'return True if sequence lst is increasing, False otherwise' for i in range(0, len(lst)-1): # i = 0, 1, 2, ..., len(lst)-2 if lst[i] > lst[i+1]: return False return True def checkSorted(lst): 'return True if sequence lst is increasing, False otherwise' for i in range(len(lst)): # compare lst[i] with lst[i+1] def checkSorted(lst): 'return True if sequence lst is increasing, False otherwise' for i in range(len(lst)-1): # i = 0, 1, 2, ..., len(lst)-2 if lst[i] <= lst[i+1]: # correctly ordered, continue on else: # incorrectly ordered, return false def checkSorted(lst): 'return True if sequence lst is increasing, False otherwise' for i in range(len(lst)-1): # i = 0, 1, 2, ..., len(lst)-2 if lst[i] > lst[i+1]: return False # all adjacent pairs are correctly ordered, return true def checkSorted(lst): 'return True if sequence lst is increasing, False otherwise' for i in range(0, len(lst)-1): # i = 0, 1, 2, ..., len(lst)-2 if lst[i] > lst[i+1]: return False return True
Exercise Introduction to Computing Using Python • Write function arithmetic()that: • takes as input a list of numbers • returns True if the numbers in the list form an arithmetic sequence, False otherwise >>> arithmetic([3, 6, 9, 12, 15]) True >>> arithmetic([3, 6, 9, 11, 14]) False >>> arithmetic([3]) True def arithmetic(lst): '''return True if list lst contains an arithmetic sequence, False otherwise''' if len(lst) < 2: # a sequence of length < 2 is arithmetic return True # check that the difference between successive numbers is # equal to the difference between the first two numbers diff = lst[1] - lst[0] for i in range(1, len(lst)-1): if lst[i+1] - lst[i] != diff: return False return True def arithmetic(lst): if len(lst) < 2: return True diff = lst[1] - lst[0] for i in range(1, len(lst)-1): if lst[i+1] - lst[i] != diff: return False return True
Accumulator loop pattern Introduction to Computing Using Python Accumulating something in every loop iteration >>> lst = [3, 2, 7, 1, 9] >>> res = 0 >>> for num in lst: res = res + num >>> res 22 >>> lst = [3, 2, 7, 1, 9] >>> res = 0 >>> for num in lst: res = res + num >>> lst = [3, 2, 7, 1, 9] >>> res = 0 >>> lst = [3, 2, 7, 1, 9] >>> lst = [3, 2, 7, 1, 9] >>> res = 0 >>> for num in lst: res += num >>> res 22 For example: the sum of numbers in a list [3, 2, 7, 1, 9] shorthand notation lst = res = 0 3 num = res = res + num (= 3) accumulator 2 num = res = res + num (= 5) 7 num = res = res + num (= 12) 1 num = res = res + num (= 13) 9 num = res = res + num (= 22)
Accumulator loop pattern Introduction to Computing Using Python Accumulating something in every loop iteration What if we wanted to obtain the product instead? What should res be initialized to? >>> lst = [3, 2, 7, 1, 9] >>> res = 1 >>> for num in lst: res *= num [3, 2, 7, 1, 9] lst = res = 1 3 num = res*= num (= 3) 2 num = res *= num (= 6) 7 num = res *= num (= 42) 1 num = res *= num (= 42) 9 num = res *= num (= 378)
Exercise Introduction to Computing Using Python • Write function factorial() that: • takes a non-negative integer nas input • returns n! if >>> factorial(0) 1 >>> factorial(1) 1 >>> factorial(3) 6 >>> factorial(6) 720 def factorial(n): 'returns n! for input integer n' res = 1 for i in range(2, n+1): res *= i return res
Exercise Introduction to Computing Using Python • Write function acronym() that: • takes a phrase (i.e., a string) as input • returns the acronym for the phrase >>> acronym('Random access memory') 'RAM' >>> acronym("GNU's not UNIX") 'GNU' def acronym(phrase): 'return the acronym of the input string phrase' # split phrase into a list of words words = phrase.split() # accumulate first character, as an uppercase, of every word res = '' for w in words: res = res + w[0].upper() return res
Exercise Introduction to Computing Using Python • Write function divisors() that: • takes a positive integer n as input • returns the list of positive divisors of n >>> divisors(1) [1] >>> divisors(6) [1, 2, 3, 6] >>> divisors(11) [1, 11] def divisors(n): 'return the list of divisors of n' res = [] # accumulator initialized to an empty list for i in range(1, n+1): if n % i == 0: # if i is a divisor of n res.append(i) # accumulate i return res
Nested loop pattern Introduction to Computing Using Python >>> n = 5 >>> nested2(n) 0 0 1 0 1 2 0 1 2 3 0 1 2 3 4 Nesting a loop inside another >>> n = 5 >>> nested(n) 0 1 2 3 4 0 1 2 3 4 0 1 2 3 4 0 1 2 3 4 0 1 2 3 4 >>> >>> n = 5 >>> nested(n) 0 1 2 3 4 >>> >>> n = 5 >>> nested(n) 0 1 2 3 4 0 1 2 3 4 0 1 2 3 4 0 1 2 3 4 0 1 2 3 4 When j = 0 inner for loop should print 0 When j = 1 inner for loop should print 0 1 When j = 2 inner for loop should print 0 1 2 When j = 3 inner for loop should print 0 1 2 3 When j = 4 inner for loop should print 0 1 2 3 4 def nested(n): for j in range(n): for i in range(n): print(i, end=' ') def nested(n): for j in range(n): for i in range(n): print(i, end=' ’) print() def nested(n): for i in range(n): print(i, end=' ') def nested(n): def nested(n): for j in range(n): for i in range(n): print(i, end=' ’) print() def nested2(n): for j in range(n): for i in range(j+1): print(i, end=' ’) print() def nested2(n): for j in range(n): for i in range(n): print(i, end=' ’) print()
Exercise Introduction to Computing Using Python • Write function bubbleSort() that: • takes a list of numbers as input and sorts the list using BubbleSort • The function returns nothing >>> lst = [3, 1, 7, 4, 9, 2, 5] >>> bubblesort(lst) >>> lst [1, 2, 3, 4, 5, 7, 9] [1, 3, 4, 7, 2, 5, 9] [1, 3, 4, 2, 5, 7, 9] [1, 2, 3, 4, 5, 7, 9] [1, 3, 4, 7, 9, 2, 5] [1, 3, 4, 7, 2, 9, 5] [1, 3, 2, 4, 5, 7, 9] [1, 3, 7, 4, 9, 2, 5] [1, 3, 4, 2, 7, 5, 9] [3, 1, 7, 4, 9, 2, 5] def bubblesort(lst): for i in range(len(lst)-1, 0, -1): # i = len(last)-1, len(lst)-2, …, 1 # number whose final position should be i # bubbles up to position i def bubblesort(lst): for i in range(len(lst)-1, 0, -1): for j in range(i): if lst[j] > lst[j+1]: lst[j], lst[j+1] = lst[j+1], lst[j]
Two-dimensional lists Introduction to Computing Using Python The list [3, 5, 7, 9] can be viewed as a 1-D table [3, 5, 7, 9] = >>> lst = [[3,5,7,9], [0,2,1,6], [3,8,3,1]] >>> lst [[3, 5, 7, 9], [0, 2, 1, 6], [3, 8, 3, 1]] >>> lst[0] [3, 5, 7, 9] >>> lst[1] [0, 2, 1, 6] >>> lst[2] [3, 8, 3, 1] >>> lst[0][0] 3 >>> lst[1][2] 1 >>> >>> lst = [[3,5,7,9], [0,2,1,6], [3,8,3,1]] >>> lst [[3, 5, 7, 9], [0, 2, 1, 6], [3, 8, 3, 1]] >>> lst[0] [3, 5, 7, 9] >>> lst[1] [0, 2, 1, 6] >>> lst[2] [3, 8, 3, 1] >>> lst[0][0] 3 >>> >>> lst = [[3,5,7,9], [0,2,1,6], [3,8,3,1]] >>> lst [[3, 5, 7, 9], [0, 2, 1, 6], [3, 8, 3, 1]] >>> lst[0] [3, 5, 7, 9] >>> lst[1] [0, 2, 1, 6] >>> lst[2] [3, 8, 3, 1] >>> >>> lst = [[3,5,7,9], [0,2,1,6], [3,8,3,1]] >>> lst [[3, 5, 7, 9], [0, 2, 1, 6], [3, 8, 3, 1]] >>> lst[0] [3, 5, 7, 9] >>> lst[1] [0, 2, 1, 6] >>> >>> lst = [[3,5,7,9], [0,2,1,6], [3,8,3,1]] >>> lst [[3, 5, 7, 9], [0, 2, 1, 6], [3, 8, 3, 1]] >>> lst[0] [3, 5, 7, 9] >>> >>> lst = [[3,5,7,9], [0,2,1,6], [3,8,3,1]] >>> >>> lst = [[3,5,7,9], [0,2,1,6], [3,8,3,1]] >>> lst [[3, 5, 7, 9], [0, 2, 1, 6], [3, 8, 3, 1]] >>> >>> lst = [[3,5,7,9], [0,2,1,6], [3,8,3,1]] >>> lst [[3, 5, 7, 9], [0, 2, 1, 6], [3, 8, 3, 1]] >>> lst[0] [3, 5, 7, 9] >>> lst[1] [0, 2, 1, 6] >>> lst[2] [3, 8, 3, 1] >>> lst[0][0] 3 >>> lst[1][2] 1 >>> lst[2][0] 3 >>> How to represent a 2-D table? 0 1 2 3 [3, 5, 7, 9] = [ [3, 5, 7, 9] [0, 2, 1, 6] [3, 8, 3, 1] ] 0 [0, 2, 1, 6] = 1 [3, 8, 3, 1] = 2 A 2-D table is just a list of rows (i.e., 1-D tables)
Nested loop pattern and 2-D lists Introduction to Computing Using Python A nested loop is often needed to access all objects in a 2-D list def print2D(t): 'prints values in 2D list t as a 2D table' def print2D(t): 'prints values in 2D list t as a 2D table' # for every row of t # for every object in the row # print object def print2D(t): 'prints values in 2D list t as a 2D table' for row in t: for item in row print(item, end=' ') def print2D(t): 'prints values in 2D list t as a 2D table' for row in t: for item in row print(item, end=' ') print() >>> table = [[3, 5, 7, 9], [0, 2, 1, 6], [3, 8, 3, 1]] >>> print2D(table) 3 5 7 9 0 2 1 6 3 8 3 1 >>> >>> table = [[3, 5, 7, 9], [0, 2, 1, 6], [3, 8, 3, 1]] >>> print2D(table) 3 5 7 9 0 2 1 6 3 8 3 1 >>> incr2D(t) >>> print2D(t) 4 6 8 10 1 3 2 7 4 9 4 2 >>> (Using the iteration loop pattern) def incr2D(t): 'increments each number in 2D list t' # for every row index i # for every column index j t[i][j] += 1 def incr2D(t): 'increments each number in 2D list t' nrows = len(t) ncols = len(t[0]) for i in range(nrows): for j in range(ncols): t[i][j] += 1 def incr2D(t): 'increments each number in 2D list t' def incr2D(t): 'increments each number in 2D list t' # nrows = number of rows in t # ncols = number of columns in t for i in range(nrows): for j in range(ncols): t[i][j] += 1 (Using the counter loop pattern)
while loop Introduction to Computing Using Python if <condition>: <indented code block> <non-indented statement> while <condition>: <indented code block> <non-indented statement> condition True <indented code block> False <non-indented statement>
while loop Introduction to Computing Using Python Example: compute the smallest multiple of 7 greater than 37. i = 7 i = 7 Idea: generate multiples of 7 until we get a number greater than 37 35 21 14 42 7 28 i= i <= 37 ? i <= 37 ? >>> i = 7>>> while i <= 37:i += 7 >>> i = 7>>> while i <= 37:i += 7>>> i42 True True >>> i = 7 >>> >>> i = 7>>> while i <= 37:i += 7>>> i42 i += 7 i += 7 False False i i
Exercise Introduction to Computing Using Python • Write function negative()that: • takes a list of numbers as input • returns the index of the first negative number in the list or -1 if there is no negative number in the list >>> lst = [3, 1, -7, -4, 9, -2] >>> negative(lst) 2 >>> negative([1, 2, 3]) -1 def greater(lst): # iterate through list lst and # compare each number with 0 # Which loop pattern shoud we use? def greater(lst): for i in range(len(lst)): # using counter loop pattern if lst[i] < 0: # number at index i is first # negative number, so return i def greater(lst): for i in range(len(lst)): if lst[i] < 0: return i # if for loop completes execution, lst contains no negative number def greater(lst): for i in range(len(lst)): if lst[i] < 0: return i return -1
Sequence loop pattern Introduction to Computing Using Python Generating a sequence that reaches the desired solution Fibonacci sequence 1 1 2 3 5 8 13 21 34 55 . . . + + + + + + + + Goal: the first Fibonnaci number greater than some bound def fibonacci(bound): 'returns the smallest Fibonacci number greater than bound' previous = 1 # previous Fibonacci number current = 1 # current Fibonacci number while current <= bound: # current becomes previous, and new current is computed previous, current = current, previous+current def fibonacci(bound): 'returns the smallest Fibonacci number greater than bound' previous = 1 # previous Fibonacci number current = 1 # current Fibonacci number while current <= bound: # not done yet, make current be next Fibonacci number def fibonacci(bound): 'returns the smallest Fibonacci number greater than bound’ def fibonacci(bound): 'returns the smallest Fibonacci number greater than bound' previous = 1 # previous Fibonacci number current = 1 # current Fibonacci number def fibonacci(bound): 'returns the smallest Fibonacci number greater than bound' previous = 1 # previous Fibonacci number current = 1 # current Fibonacci number while current <= bound: # current becomes previous, and new current is computed def fibonacci(bound): 'returns the smallest Fibonacci number greater than bound' previous = 1 # previous Fibonacci number current = 1 # current Fibonacci number while current <= bound: # current becomes previous, and new current is computed previous, current = current, previous+current return current
Exercise Introduction to Computing Using Python • Write function approxE()that approximates the Euler constant as follows: • takes a number as input • returns the approximation such that >>> approxE(0.01) 2.7166666666666663 >>> approxE(0.000000001) 2.7182818284467594 def approxE(error): prev = 1 # approximation 0 current = 2 # approximation 1 while current - prev > error: # compute new prev and current return current def approxE(error): prev = 1 # approximation 0 current = 2 # approximation 1 while current - prev > error: # new prev is old current # new current is old current + 1/factorial(?) return current def approxE(error): prev = 1 # approximation 0 current = 2 # approximation 1 i = 2 # index of next approximation while current - prev > error: prev, current = current, current + 1/factorial(i) i += 1 # index of next approximation return current
Infinite loop pattern Introduction to Computing Using Python An infinite loop provides a continuous service >>> hello2() What is your name? >>> hello2() What is your name? Sam Hello Sam What is your name? >>> hello2() What is your name? Sam Hello Sam What is your name? Tim Hello Tim What is your name? >>> hello2() What is your name? Sam Hello Sam What is your name? Tim Hello Tim What is your name? Alex Hello Alex What is your name? A greeting service The servercould instead be a time server, or a web server, or a mail server, or… def hello2(): '''a greeting service; it repeatedly requests the name of the user and then greets the user''’ while True: name = input('What is your name? ') print('Hello {}'.format(name))
Loop-and-a-half pattern Introduction to Computing Using Python Cutting the last loop iteration “in half” Example: a function that creates a list of cities entered by the user and returns it >>> cities() Enter city: >>> cities() Enter city: Lisbon Enter city: >>> cities() Enter city: Lisbon Enter city: San Francisco Enter city: >>> cities() Enter city: Lisbon Enter city: San Francisco Enter city: Hong Kong Enter city: >>> cities() Enter city: Lisbon Enter city: San Francisco Enter city: Hong Kong Enter city: ['Lisbon', 'San Francisco', 'Hong Kong'] >>> The empty string is a “flag” that indicates the end of the input def cities(): lst = [] city = input('Enter city: ') while city != '': lst.append(city) city = input('Enter city: ') return lst def cities2(): lst = [] # repeat: # ask user to enter city # if user entered flag # then return lst # append city to lst def cities2(): lst = [] while True: city = input('Enter city: ') if city == '': return lst lst.append(city) last loop iteration stops here accumulator pattern awkward and not quite intuitive
The break statement Introduction to Computing Using Python Thebreakstatement: • is used inside the body of a loop • when executed, it interrupts the current iteration of the loop • executioncontinues with the statement that follows the loop body. def cities2(): lst = [] while True: city = input('Enter city: ') if city == '': return lst lst.append(city) def cities2(): lst = [] while True: city = input('Enter city: ') if city == '': break lst.append(city) return lst
break and continue statements Introduction to Computing Using Python Thecontinue statement: • is used inside the body of a loop • when executed, it interrupts the current iteration of the loop • executioncontinues with next iteration of the loop Thebreakstatement: • is used inside the body of a loop • when executed, it interrupts the current iteration of the loop • executioncontinues with the statement that follows the loop body. In both cases, only the innermost loop is affected >>> before0(table) 2 3 4 5 6 >>> table = [ [2, 3, 0, 6], [0, 3, 4, 5], [4, 5, 6, 0]] >>> ignore0(table) 2 3 6 3 4 5 4 5 6 def before0(table): for row in table: for num in row: if num == 0: break print(num, end=' ’) print() def ignore0(table): for row in table: for num in row: if num == 0: continue print(num, end=' ’) print()