A simple hash table code, to be continued
import random
HT = [None for x in range(15)]
res = random.randrange(100)
key = 13
l = len(HT)
#
# count(elements)<key<l
#
def insert(n):
ans = n%key
while HT[ans] is not None:
if HT[ans] is n:
return
ans = (ans+1)%key
HT[ans] = n
def search(n):
ans = n%key;
while HT[ans] is not None:
if HT[ans] is n:
return ans
ans = (ans+1)%key
return 'Not founded'
if __name__ == "__main__":
for i in range(10):
res = random.randrange(100)
print(res,end=' ')
insert(res)
print()
for i in range(10):
res = random.randrange(100)
print(res,search(res),sep=' ')
for x in range(l):
print(HT[x],end=' ')
print()