[1] Add benchmarking
This commit is contained in:
parent
cc8f679e79
commit
729a0a8695
|
|
@ -1,3 +1,10 @@
|
||||||
|
import random
|
||||||
|
import time
|
||||||
|
import csv
|
||||||
|
import sys
|
||||||
|
|
||||||
|
sys.setrecursionlimit(20000)
|
||||||
|
|
||||||
|
|
||||||
def llist_insert(head, name, phone):
|
def llist_insert(head, name, phone):
|
||||||
current = head
|
current = head
|
||||||
|
|
@ -150,14 +157,118 @@ def bst_get_all(root):
|
||||||
return result
|
return result
|
||||||
|
|
||||||
|
|
||||||
|
def generate_phonebook_entries(n, seed=42):
|
||||||
|
random.seed(seed)
|
||||||
|
records = []
|
||||||
|
for i in range(1, n + 1):
|
||||||
|
name = f"User_{i:05d}"
|
||||||
|
phone = f"{random.randint(100,999)}-{random.randint(1000,9999)}"
|
||||||
|
records.append((name, phone))
|
||||||
|
return records
|
||||||
|
|
||||||
|
|
||||||
|
def prepare_datasets(base_records):
|
||||||
|
shuffled = base_records.copy()
|
||||||
|
random.shuffle(shuffled)
|
||||||
|
sorted_records = sorted(base_records, key=lambda x: x[0])
|
||||||
|
return shuffled, sorted_records
|
||||||
|
|
||||||
|
|
||||||
|
def run_experiment(struct_funcs, records, mode_name, repeats=5):
|
||||||
|
all_results = []
|
||||||
|
for rep in range(repeats):
|
||||||
|
struct = struct_funcs['create']()
|
||||||
|
|
||||||
|
start = time.perf_counter()
|
||||||
|
for name, phone in records:
|
||||||
|
struct = struct_funcs['insert'](struct, name, phone)
|
||||||
|
insert_time = time.perf_counter() - start
|
||||||
|
|
||||||
|
existing_names = [name for name, _ in records]
|
||||||
|
sample_existing = random.sample(existing_names, 100)
|
||||||
|
nonexistent = [f"None_{i}" for i in range(10)]
|
||||||
|
search_names = sample_existing + nonexistent
|
||||||
|
random.shuffle(search_names)
|
||||||
|
|
||||||
|
start = time.perf_counter()
|
||||||
|
for name in search_names:
|
||||||
|
_ = struct_funcs['find'](struct, name)
|
||||||
|
find_time = time.perf_counter() - start
|
||||||
|
|
||||||
|
to_delete = random.sample(existing_names, 50)
|
||||||
|
start = time.perf_counter()
|
||||||
|
for name in to_delete:
|
||||||
|
struct = struct_funcs['delete'](struct, name)
|
||||||
|
delete_time = time.perf_counter() - start
|
||||||
|
|
||||||
|
all_results.append({
|
||||||
|
'structure': struct_funcs['name'],
|
||||||
|
'mode': mode_name,
|
||||||
|
'repetition': rep + 1,
|
||||||
|
'insert_time': insert_time,
|
||||||
|
'find_time': find_time,
|
||||||
|
'delete_time': delete_time
|
||||||
|
})
|
||||||
|
return all_results
|
||||||
|
|
||||||
|
|
||||||
|
def run_benchmark():
|
||||||
|
N = 10000
|
||||||
|
REPEATS = 5
|
||||||
|
|
||||||
|
base_records = generate_phonebook_entries(N)
|
||||||
|
shuffled_records, sorted_records = prepare_datasets(base_records)
|
||||||
|
|
||||||
|
structures = {
|
||||||
|
'LinkedList': {
|
||||||
|
'name': 'LinkedList',
|
||||||
|
'create': lambda: None,
|
||||||
|
'insert': llist_insert,
|
||||||
|
'find': llist_find,
|
||||||
|
'delete': llist_delete,
|
||||||
|
'get_all': llist_get_all
|
||||||
|
},
|
||||||
|
'HashTable': {
|
||||||
|
'name': 'HashTable',
|
||||||
|
'create': ht_create,
|
||||||
|
'insert': ht_insert,
|
||||||
|
'find': ht_find,
|
||||||
|
'delete': ht_delete,
|
||||||
|
'get_all': ht_get_all
|
||||||
|
},
|
||||||
|
'BST': {
|
||||||
|
'name': 'BST',
|
||||||
|
'create': lambda: None,
|
||||||
|
'insert': bst_insert,
|
||||||
|
'find': bst_find,
|
||||||
|
'delete': bst_delete,
|
||||||
|
'get_all': bst_get_all
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
all_results = []
|
||||||
|
|
||||||
|
for struct_name, funcs in structures.items():
|
||||||
|
results_random = run_experiment(funcs, shuffled_records, 'random', REPEATS)
|
||||||
|
all_results.extend(results_random)
|
||||||
|
results_sorted = run_experiment(funcs, sorted_records, 'sorted', REPEATS)
|
||||||
|
all_results.extend(results_sorted)
|
||||||
|
|
||||||
|
with open('experiment_results.csv', 'w', newline='', encoding='utf-8') as f:
|
||||||
|
writer = csv.writer(f)
|
||||||
|
writer.writerow(['Structure', 'Mode', 'Repeat', 'Insert (sec)', 'Search (sec)', 'Delete (sec)'])
|
||||||
|
for r in all_results:
|
||||||
|
writer.writerow([
|
||||||
|
r['structure'],
|
||||||
|
r['mode'],
|
||||||
|
r['repetition'],
|
||||||
|
f"{r['insert_time']:.6f}",
|
||||||
|
f"{r['find_time']:.6f}",
|
||||||
|
f"{r['delete_time']:.6f}"
|
||||||
|
])
|
||||||
|
|
||||||
|
print("Experiment finished. Results saved to 'experiment_results.csv'.")
|
||||||
|
|
||||||
|
|
||||||
if __name__ == '__main__':
|
if __name__ == '__main__':
|
||||||
root = None
|
run_benchmark()
|
||||||
root = bst_insert(root, "Charlie", "111-111")
|
|
||||||
root = bst_insert(root, "Alice", "222-222")
|
|
||||||
root = bst_insert(root, "Bob", "333-333")
|
|
||||||
root = bst_insert(root, "Alice", "444-444")
|
|
||||||
print(bst_find(root, "Alice"))
|
|
||||||
print(bst_find(root, "Bob"))
|
|
||||||
print(bst_get_all(root))
|
|
||||||
root = bst_delete(root, "Bob")
|
|
||||||
print(bst_get_all(root))
|
|
||||||
Loading…
Reference in New Issue
Block a user