import time import random import csv import sys # 1. LinkedList def ll_insert(head, name, phone): new_node = {'name': name, 'phone': phone, 'next': None} if head is None: return new_node if head['name'] == name: head['phone'] = phone return head current = head while current['next'] is not None: if current['next']['name'] == name: current['next']['phone'] = phone return head current = current['next'] current['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_list_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 # 2. Hash Function def hash_function(name, table_size): return sum(ord(c) for c in name) % table_size def ht_create(size=1000): return [None] * size def ht_insert(buckets, name, phone): size = len(buckets) index = hash_function(name, size) buckets[index] = ll_insert(buckets[index], name, phone) def ht_find(buckets, name): size = len(buckets) index = hash_function(name, size) return ll_find(buckets[index], name) def ht_delete(buckets, name): size = len(buckets) index = hash_function(name, size) buckets[index] = ll_delete(buckets[index], name) def ht_list_all(buckets): records = [] for bucket in buckets: current = bucket while current is not None: records.append((current['name'], current['phone'])) current = current['next'] records.sort(key=lambda x: x[0]) return records #3. Tree function def bst_insert(root, name, phone): if root is None: return {'name': name, 'phone': phone, 'left': None, 'right': None} if name < root['name']: root['left'] = bst_insert(root['left'], name, phone) elif name > root['name']: root['right'] = bst_insert(root['right'], name, phone) else: root['phone'] = phone return root def bst_find(root, name): current = root while current is not None: if name == current['name']: return current['phone'] elif name < current['name']: current = current['left'] else: current = current['right'] return None def bst_find_min(node): current = node while current['left'] is not None: current = current['left'] return current def bst_delete(root, name): if root is None: return None if name < root['name']: root['left'] = bst_delete(root['left'], name) elif name > root['name']: root['right'] = bst_delete(root['right'], name) else: if root['left'] is None: return root['right'] elif root['right'] is None: return root['left'] min_node = bst_find_min(root['right']) root['name'] = min_node['name'] root['phone'] = min_node['phone'] root['right'] = bst_delete(root['right'], min_node['name']) return root def bst_list_all(root): records = [] def inorder_traversal(node): if node is not None: inorder_traversal(node['left']) records.append((node['name'], node['phone'])) inorder_traversal(node['right']) inorder_traversal(root) return records #EXPERIMENTAL PART # 1. Test data generation def generate_records(count=10000): records = [] for i in range(count): name = f"User_{i:05d}" phone = f"+7-{random.randint(100,999)}-{random.randint(100,999)}-{random.randint(1000,9999)}" records.append((name, phone)) shuffled = records.copy() random.shuffle(shuffled) sorted_records = sorted(records, key=lambda x: x[0]) return shuffled, sorted_records # 2. Timing def measure_insertion(structure_name, records): times = [] filled_structure = None for run in range(5): if structure_name == "linked_list": structure = None elif structure_name == "hash_table": structure = ht_create(1000) elif structure_name == "bst": structure = None start = time.perf_counter() for name, phone in records: if structure_name == "linked_list": structure = ll_insert(structure, name, phone) elif structure_name == "hash_table": ht_insert(structure, name, phone) elif structure_name == "bst": structure = bst_insert(structure, name, phone) end = time.perf_counter() times.append(end - start) if run == 4: filled_structure = structure return times, filled_structure def measure_search(structure_name, structure, search_names): times = [] for run in range(5): start = time.perf_counter() for name in search_names: if structure_name == "linked_list": ll_find(structure, name) elif structure_name == "hash_table": ht_find(structure, name) elif structure_name == "bst": bst_find(structure, name) end = time.perf_counter() times.append(end - start) return times def measure_deletion(structure_name, original_structure, delete_names): times = [] for run in range(5): if structure_name == "linked_list": all_records = ll_list_all(original_structure) test_structure = None for name, phone in all_records: test_structure = ll_insert(test_structure, name, phone) elif structure_name == "hash_table": all_records = ht_list_all(original_structure) test_structure = ht_create(1000) for name, phone in all_records: ht_insert(test_structure, name, phone) elif structure_name == "bst": all_records = bst_list_all(original_structure) test_structure = None for name, phone in all_records: test_structure = bst_insert(test_structure, name, phone) start = time.perf_counter() for name in delete_names: if structure_name == "linked_list": test_structure = ll_delete(test_structure, name) elif structure_name == "hash_table": ht_delete(test_structure, name) elif structure_name == "bst": test_structure = bst_delete(test_structure, name) end = time.perf_counter() times.append(end - start) return times