2026-rff_mp/tseremonnikovaaa/task 1/docs/data/main.py

87 lines
2.2 KiB
Python
Raw Normal View History

2026-05-22 19:08:31 +00:00
import time
import random
import csv
import sys
import matplotlib.pyplot as plt
import numpy as np
sys.setrecursionlimit(20000)
REPEATS = 5
N = 10000
def ll_insert(head, name, phone):
current = head
prev = None
while current is not None:
if current['name'] == name:
current['phone'] = phone
return head
prev = current
current = current['next']
new_node = {'name': name, 'phone': phone, 'next': None}
if prev is None:
return new_node
else:
prev['next'] = new_node
return head
def ll_find(head, name):
current = head
while current is not None:
if current['name'] == name:
return current['phone']
current = current['next']
return None
def ll_delete(head, name):
if head is None:
return None
if head['name'] == name:
return head['next']
current = head
while current['next'] is not None:
if current['next']['name'] == name:
current['next'] = current['next']['next']
return head
current = current['next']
return head
def ll_collect_all(head):
records = []
current = head
while current is not None:
records.append((current['name'], current['phone']))
current = current['next']
records.sort(key=lambda x: x[0])
return records
2026-05-22 19:59:13 +00:00
def hash_function(name, size):
total = 0
for ch in name:
total = (total * 31 + ord(ch)) % size
return total
def ht_create(size=2000):
return [None] * size
def ht_insert(buckets, name, phone):
idx = hash_function(name, len(buckets))
buckets[idx] = ll_insert(buckets[idx], name, phone)
def ht_find(buckets, name):
idx = hash_function(name, len(buckets))
return ll_find(buckets[idx], name)
def ht_delete(buckets, name):
idx = hash_function(name, len(buckets))
buckets[idx] = ll_delete(buckets[idx], name)
def ht_collect_all(buckets):
all_records = []
for bucket in buckets:
current = bucket
while current is not None:
all_records.append((current['name'], current['phone']))
current = current['next']
all_records.sort(key=lambda x: x[0])
return all_records