Analiza in primerjava manj znanih algoritmov za urejanje

diplomsko delo

Martin Arsovski (Author), Luka Fürst (Mentor)

Abstract

V svetu programiranja je urejanje podatkov zelo pomembno. Sčasoma so ljudje implementirali veliko različnih algoritmov, ki rešujejo ta problem ali pa izboljšujejo že obstoječe. Diplomsko delo obravnava problem urejanja podatkov na podlagi manj znanih algoritmov. Implementirani in analizirani so naslednji: sodo-liho urejanje (Odd-even sort), comb sort, ciklično urejanje (Cycle sort), pigeonhole sort, urejanje z drevesom (Tree sort) in timsort. Primerjava algoritmov je izvedena na podlagi prostorske in časovne zahtevnosti, dejanskega časa izvajanja, števila primerjav, števila prireditev in števila rekurzivnih klicev (če jih imajo). Da bi bila analiza realna, so vsi algoritmi analizirani na podlagi podobnih testnih podatkov, ki zajemajo večino možnih scenarijev pri urejanju.

Keywords

algoritem;urejanje;implementacija;analiza;testni podatki;računalništvo in informatika;univerzitetni študij;diplomske naloge;

Data

Language:	Slovenian
Year of publishing:	2020
Typology:	2.11 - Undergraduate Thesis
Organization:	UL FRI - Faculty of Computer and Information Science
Publisher:	[M. Arsovski]
UDC:	004(043.2)
COBISS:	27807491
Views:	534
Downloads:	139
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Analyzing and comparing less known sorting algorithms
Secondary abstract:	In the world of programming, sorting is very important. Over time, people have implemented many different algorithms that solve this problem or improve existing ones. The diploma thesis deals with the problem of data sorting using less known algorithms. Some of them have been implemented and analyzed: Odd-even Sort, Comb sort, Cycle sort, Pigeonhole sort, Tree sort, and Tim sort. The comparison of algorithms is based on the time and space complexity, the actual execution time, the number of comparisons, the number of assignments, and the number of recursive calls (if any). To make the analysis realistic, all algorithms are analyzed on similar test data. The test data cover most of the possible scenarios that could occur during sorting.
Secondary keywords:	algorithm;sorting;implementation;analysis;test data;computer and information science;diploma;
Type (COBISS):	Bachelor thesis/paper
Study programme:	1000468
Embargo end date (OpenAIRE):	1970-01-01
Thesis comment:	Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages:	45 str.
ID:	12025906