Calculating the time complexity of algorithms: calculating the rate of growth of the algorithm with respect to the input
Loading...
Date
Authors
ORCID
DOI
item.page.thesis.degree.name
item.page.thesis.degree.level
item.page.thesis.degree.discipline
item.page.thesis.degree.department
item.page.thesis.degree.grantor
item.page.thesis.degree.advisor
item.page.thesis.degree.committeeMember
Journal Title
Journal ISSN
Volume Title
Publisher
Kharkiv : V. N. Karazin Kharkiv National University
Abstract
Description
Керівник роботи: Морозова Анастасія Геннадіївна, старший викладач, кандидат технічних наук кафедри теоретичної та прикладної інформатики
Citation
Zhang, Hua. Calculating the time complexity of algorithms: calculating the rate of growth of the algorithm with respect to the input : master’s thesis : specialty Computer Sciences and Information Technologies : educational program "Informatics" / H. Zhang ; supervisor A. H. Morozovа. – Kharkiv : V. N. Karazin Kharkiv National University, 2024. – 35 с.