Solving the Knapsack Problem in sorting algorithms

Loading...
Thumbnail Image

Date

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

Wan, Shuangquan. Solving the Knapsack Problem in sorting algorithms : master’s thesis : specialty Computer Sciences and Information Technologies : educational program "Informatics" / Shuangquan Wan ; supervisor I. T. Zaretska. – Kharkiv : V. N. Karazin Kharkiv National University, 2024. – 59 с.

Endorsement

Review

Supplemented By

Referenced By