Foundations contd
Problem : Prime number
Hi sara
number = 9
index = 2
result = Prime
until index < number
if number % index == 0 result = Not Prime exit
index = index + 1
say result
Remember above steps as is_prime
Hi sara
find is_prime 5 => Prime
find is_prime 10 => Not Prime
- Sara can solve problems by giving a solution a name
- conversation
Hi sara
number = 13195
index = number / 2
while index > 2
if number % index == 0 and is_prime index == 'Prime':
say index and exit
index = index - 1
Project euler 5
Hi sara
number = 5
# numbers 1,2,3,4,5
result = number * number - 1
increment = number * number - 1
until true we find answer
index = 1
found_answer = True
until index <= number
if result % index !=0
result = result + increment
found_answer = False
break
index = index + 1
if found_answer
say result
exit
Remember the above steps as lcm
Python
- Terms:
- Zen of Python
- Multi purpose programming (scripting, object oriented, procedural…)
- PEP (Python enhancement proposals)
- Interesting PEPs
- Pythonic coding/programming
