Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Lab_III_3_01_12_2020
def GCD_recursive(n, m): if n < m: m, n = n, m if m == 0: return n else: return GCD_recursive(m, n % m) # Task 3. Write an iterative version of the above function # Team 1: # Akhilesh Patel, Anand Panchal, Brian Bvunza # Team 2: # Gaous Saklaen, Ivan Sulaiman # Team 3 # Nabeel Yassine, Pruthvirajsinh Vala, Tendai Tarisai Matsinde # Team 4 # Yuran Onions, Jainal Panchal
run
|
edit
|
history
|
help
0
ReverseArray.py
Reverse number
🙆👌
Calculate Volume of Sphere
yield from example
(P3) Scrabble
Find common characters between two strings
GINGERMANZ
new traceback.py
isPalindrome.py