UNN/2026-rff_mp
16
14
Fork 113
Code Issues Pull Requests 15 Actions Packages Projects Releases Wiki Activity

[15] adding file_insert() to create a csv file

Browse Source
This commit is contained in:
lukovnikovde 2026-05-06 12:56:10 +00:00
parent 7c65ec1f5c
commit 81899baf6e
1 changed files with 43 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

43
lukovnikovde/docs/data/DataStructure.py
View File

@ -1,5 +1,6 @@
import random as rnd import random as rnd
import time import time
import csv
############################################################################################# #############################################################################################
def sort_list(name_list): def sort_list(name_list):
@ -18,6 +19,11 @@ def create_name_phone(i):
name = f"User_{i:03d}" name = f"User_{i:03d}"
phone = f"{rnd.randint(100, 999)}-{rnd.randint(100, 999)}" phone = f"{rnd.randint(100, 999)}-{rnd.randint(100, 999)}"
return (name, phone) return (name, phone)
def file_insert(results):
with open("results.csv", "w", encoding = "utf-8-sig", newline = "") as file:
writer = csv.writer(file)
writer.writerows(results)
########################################################################################################################### ###########################################################################################################################
def ll_insert(head, name, phone): def ll_insert(head, name, phone):
@ -413,7 +419,44 @@ def main():
print(Time_bst_sorted[i]) print(Time_bst_sorted[i])
print(f"Average: {Time_average_bst_sorted}\n\n") print(f"Average: {Time_average_bst_sorted}\n\n")
print("=============================================== END TESTING ================================================") print("=============================================== END TESTING ================================================")
results = [["Структура", "Режим", "Операция", "Время(мс)"]]
for i in range(replay):
results.append(["LinkedList", "Случайный", "вставка", Time_ll_not_sorted[i]["insert"]])
results.append(["LinkedList", "Случайный", "поиск", Time_ll_not_sorted[i]["find"]])
results.append(["LinkedList", "Случайный", "удаление", Time_ll_not_sorted[i]["delete"]])
results.append(["LinkedList", "Случайный", "формирование списка", Time_ll_not_sorted[i]["list"]])
results.append(["LinkedList", "Упорядоченный", "вставка", Time_ll_sorted[i]["insert"]])
results.append(["LinkedList", "Упорядоченный", "поиск", Time_ll_sorted[i]["find"]])
results.append(["LinkedList", "Упорядоченный", "удаление", Time_ll_sorted[i]["delete"]])
results.append(["LinkedList", "Упорядоченный", "формирование списка", Time_ll_sorted[i]["list"]])
for i in range(replay):
results.append(["HashTable", "Случайный", "вставка", Time_ht_not_sorted[i]["insert"]])
results.append(["HashTable", "Случайный", "поиск", Time_ht_not_sorted[i]["find"]])
results.append(["HashTable", "Случайный", "удаление", Time_ht_not_sorted[i]["delete"]])
results.append(["HashTable", "Случайный", "формирование списка", Time_ht_not_sorted[i]["list"]])
results.append(["HashTable", "Упорядоченный", "вставка", Time_ht_sorted[i]["insert"]])
results.append(["HashTable", "Упорядоченный", "поиск", Time_ht_sorted[i]["find"]])
results.append(["HashTable", "Упорядоченный", "удаление", Time_ht_sorted[i]["delete"]])
results.append(["HashTable", "Упорядоченный", "формирование списка", Time_ht_sorted[i]["list"]])
for i in range(replay):
results.append(["BinarySearchTree", "Случайный", "вставка", Time_bst_not_sorted[i]["insert"]])
results.append(["BinarySearchTree", "Случайный", "поиск", Time_bst_not_sorted[i]["find"]])
results.append(["BinarySearchTree", "Случайный", "удаление", Time_bst_not_sorted[i]["delete"]])
results.append(["BinarySearchTree", "Случайный", "формирование списка", Time_bst_not_sorted[i]["list"]])
results.append(["BinarySearchTree", "Упорядоченный", "вставка", Time_bst_sorted[i]["insert"]])
results.append(["BinarySearchTree", "Упорядоченный", "поиск", Time_bst_sorted[i]["find"]])
results.append(["BinarySearchTree", "Упорядоченный", "удаление", Time_bst_sorted[i]["delete"]])
results.append(["BinarySearchTree", "Упорядоченный", "формирование списка", Time_bst_sorted[i]["list"]])
for i in range(1, len(results) - 1):
results[i][3] *= 1000
file_insert(results)
if __name__ == "__main__": if __name__ == "__main__":
main() main()