Thesis Details
Demonstrační program metod řazení v jazyce C
The one of the basic skill of every computer programer in the subject of Information technology is to manage the problems of the sorting algorithm. Sorting algorithms are used in the very wide range and though they are writed differently in a different programming language, their principal remains same.
At this work I'm going to deal with the problems of sorting algorithm and description of the program, which is part of this bachelor's thesis. The program have to demonstrate by the simple way the principles of the most used sorting algorithms and give us the clue to easier understanding of the sorting methods.
Sorting algorithm, demonstrational program, Binary Insert sort, Bubble sort, Select sort, Heap sort, Shell sort, Quick sort, Merge sort, divide and conquer, WIN API, graphics environment
Křena Bohuslav, Ing., Ph.D. (DITS FIT BUT), člen
Kunovský Jiří, doc. Ing., CSc. (DITS FIT BUT), člen
Lukáš Roman, Ing., Ph.D. (DIFS FIT BUT), člen
Martinek David, Ing. (DIFS FIT BUT), člen
Sojka Petr, doc. RNDr., Ph.D. (FI MUNI), člen
@bachelorsthesis{FITBT5000, author = "Luk\'{a}\v{s} Pernica", type = "Bachelor's thesis", title = "Demonstra\v{c}n\'{i} program metod \v{r}azen\'{i} v jazyce C", school = "Brno University of Technology, Faculty of Information Technology", year = 2007, location = "Brno, CZ", language = "czech", url = "https://www.fit.vut.cz/study/thesis/5000/" }