-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLoop vs Recursion
More file actions
71 lines (53 loc) · 1.02 KB
/
Loop vs Recursion
File metadata and controls
71 lines (53 loc) · 1.02 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#loop
prev2 = 0
prev1 = 1
print(prev2)
print(prev1)
for fibo in range(18):
newFibo = prev1 + prev2
print(newFibo)
prev2 = prev1
prev1 = newFibo
#Above and below fibon are differ
prev2 = 0
prev1 = 1
print(prev2)
print(prev1)
for fibo in range(18):
newFibo = prev1 + prev2
print(newFibo)
prev1 = prev2
prev2 = newFibo
#Recursion
print(0)
print(1)
count = 2
def fibonacci(prev1, prev2):
global count
if count <= 19:
newFibo = prev1 + prev2
print(newFibo)
prev2 = prev1
prev1 = newFibo
count += 1
fibonacci(prev1, prev2)
else:
return
fibonacci(1,0)
# THE nth fibonacci
def F(n):
if n <= 1:
return n
else:
return F(n - 1) + F(n - 2)
print(F(19))
Arrays
my_Array = [7, 2, 4, 5, 6]
print(my_Array[4])
# lowest value
my_Array = [7, 12, 9, 4, 6]
minVal = my_Array[0]
for current in my_Array:
if current <= minVal:
minVal = current
print('lowest value:', minVal)