-
Notifications
You must be signed in to change notification settings - Fork 0
/
sort.py
executable file
·67 lines (51 loc) · 1.13 KB
/
sort.py
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
# file = open('RandomNumbers.txt')
#
# numbers = []
#
# for line in file:
# numbers.append(int(line.strip()))
#
# file.close()
#
# print(numbers)
#
# for currentposition in range(len(numbers)):
# minimumposition = currentposition
#
# for scanposition in range(currentposition + 1, len(numbers)):
# if numbers[scanposition] < numbers[minimumposition]:
# minimumposition = scanposition
#
# temp = numbers[minimumposition]
# numbers[minimumposition] = numbers[currentposition]
# numbers[currentposition] = temp
#
# print(numbers)
# # for nums in numbers:
# # print(nums)
#
# print("We have " + str(len(numbers)) + " numbers in our file.")
#
# # for current position in range(len(numbers)):
# # minimumposition
# FIB
sequence = []
init_1 = 0
init_2 = 1
sequence.append(init_1)
sequence.append(init_2)
ind = 1
# currentpos = sequence[ind]
def fib(lim):
ind = 1
while ind <= lim:
nextnum = int(sequence[ind - 1] + sequence[ind])
sequence.append(nextnum)
print(sequence[ind + 1])
ind += 1
# TODO:
# def euler(max):
#
#
#
# while