126 lines
3.4 KiB
Python
126 lines
3.4 KiB
Python
import time
|
|
import random
|
|
import csv
|
|
import matplotlib.pyplot as plt
|
|
import numpy as np
|
|
|
|
def ll_insert(head, name, phone):
|
|
new_node = {'name': name, 'phone': phone, 'next': None}
|
|
if head is None:
|
|
return new_node
|
|
current = head
|
|
while current:
|
|
if current['name'] == name:
|
|
current['phone'] = phone
|
|
return head
|
|
if current['next'] is None:
|
|
current['next'] = new_node
|
|
return head
|
|
current = current['next']
|
|
return head
|
|
|
|
def ll_find(head, name):
|
|
current = head
|
|
while current:
|
|
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']:
|
|
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:
|
|
records.append((current['name'], current['phone']))
|
|
current = current['next']
|
|
return sorted(records, key=lambda x: x[0])
|
|
def hash_func(name, size):
|
|
return sum(ord(c) for c in name) % size
|
|
|
|
def ht_create(size=1000):
|
|
return [None] * size
|
|
|
|
def ht_insert(table, name, phone):
|
|
idx = hash_func(name, len(table))
|
|
table[idx] = ll_insert(table[idx], name, phone)
|
|
|
|
def ht_find(table, name):
|
|
idx = hash_func(name, len(table))
|
|
return ll_find(table[idx], name)
|
|
|
|
def ht_delete(table, name):
|
|
idx = hash_func(name, len(table))
|
|
table[idx] = ll_delete(table[idx], name)
|
|
|
|
def ht_list_all(table):
|
|
records = []
|
|
for bucket in table:
|
|
current = bucket
|
|
while current:
|
|
records.append((current['name'], current['phone']))
|
|
current = current['next']
|
|
return sorted(records, key=lambda x: x[0])
|
|
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):
|
|
if root is None:
|
|
return None
|
|
if name == root['name']:
|
|
return root['phone']
|
|
elif name < root['name']:
|
|
return bst_find(root['left'], name)
|
|
else:
|
|
return bst_find(root['right'], name)
|
|
|
|
def bst_min(node):
|
|
while node and node['left']:
|
|
node = node['left']
|
|
return node
|
|
|
|
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']
|
|
if root['right'] is None:
|
|
return root['left']
|
|
min_node = bst_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 = []
|
|
if root:
|
|
records.extend(bst_list_all(root['left']))
|
|
records.append((root['name'], root['phone']))
|
|
records.extend(bst_list_all(root['right']))
|
|
return records |