Back to search

Institutional Repository of Vilnius University

Rūšiavimo algoritmų vizualizavimas ir sudėtingumo analizė /

Abstract

dc:description

There is a lot of complexity analysis of sorting algorithms can be found without problems, so the main idea of this work was to create a visualization of sorting algorithms. This work was created three simple sorting algorithms (insertion sort, bubble sort and selection sort), and two high-speed sorting algorithms (Shell sort and merge sort) visualization. This program is capable of calculating sorting time of sorting algorithm for further sorting algorithm complexity analysis.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2012

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Saročka, Gediminas,
Contributors dc:contributor
  • Sirius, Vaclovas

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
lit

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Saročka, Gediminas,. Rūšiavimo algoritmų vizualizavimas ir sudėtingumo analizė /. Institutional Repository of Vilnius University, 2012. https://repository.vu.lt/VU:ELABAETD2098984&prefLang=en_US