Всем привет.
У меня есть вот такой интуитивно понятный код
class Node:
def
init(self, data=None):
self.data = data
self.next = None
def HashFunction(Elem, size):
return Elem % size
def put(size, Elem, Slots):
hash_value = HashFunction(Elem, size)
if Slots[hash_value] is None:
Slots[hash_value] = Elem
else:
temp = Node(Elem)
p = Slots[hash_value]
while
p.next is not None:
p =
p.nextf = open('sample.txt', "r")
data = []
for line in f:
data.append(int(line.strip('\n')))
print(data)
NumLines = sum(1 for line in open('sample.txt'))
slots = [None] * NumLines
for i, element in enumerate(data):
el = element
print(HashFunction(el, NumLines))
put(NumLines, el, slots)