|
|
Sorting Algorithms in C Language
Vaněk, Jiří ; Křena, Bohuslav (referee) ; Honzík, Jan M. (advisor)
This thesis deals with the sorting algorithms in the context of studying them. The purpose is to provide the students with materials, which can help them with the understanding of these algorithms. The work consists of the rewriting of the study-supporting materials into the C language, the creation of a test program for the appropriate algorithms and the creation of an animation to demonstrate the functionality of the selected algorithms.
|
|
|
Sorting Algorithms
Richter, Jan ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
The bachelor thesis deals with basic types of sorting algorithms. We are able to divide these algorithms into two groups, which are elementary (direct) sorting algorithms and difficult (optimized) ones. From the group of direct algorithms, the thesis is dedicated to algorithms of direct paste, direct selection, and direct exchange, which could be further divided into bubblesort and shakersort. From the second group of optimized algorithms in the thesis, sorting with miniaturizing of steps (Shellsort) and dividing sorting (Quicksort) are described. In context of these algorithms, I deal with syntaxes and also effectiveness, with which they are able to sort the given system. Criteria of effectiveness are comparison and movement calculations, which are the function of only one parameter – the number of members in the system.
|
|
|
Sorting algorithms
Lýsek, Jiří ; Šeda, Miloš (referee) ; Dvořák, Jiří (advisor)
This thesis deals with a problem of sorting arrays, which is one of known problems in computer science. It defines concepts of sorting, algorithm and algorithm complexity. It describes sorting algorithms from the easiest ones to the selected more difficult methods. Finally, the algorithms are compared according to number of needed operations and time needed for the whole sorting process.
|
|
|
Sorting Algorithms in C Language
Vaněk, Jiří ; Křena, Bohuslav (referee) ; Honzík, Jan M. (advisor)
This thesis deals with the sorting algorithms in the context of studying them. The purpose is to provide the students with materials, which can help them with the understanding of these algorithms. The work consists of the rewriting of the study-supporting materials into the C language, the creation of a test program for the appropriate algorithms and the creation of an animation to demonstrate the functionality of the selected algorithms.
|
|
|
Sorting Algorithms
Richter, Jan ; Dvořák, Jiří (referee) ; Šeda, Miloš (advisor)
The bachelor thesis deals with basic types of sorting algorithms. We are able to divide these algorithms into two groups, which are elementary (direct) sorting algorithms and difficult (optimized) ones. From the group of direct algorithms, the thesis is dedicated to algorithms of direct paste, direct selection, and direct exchange, which could be further divided into bubblesort and shakersort. From the second group of optimized algorithms in the thesis, sorting with miniaturizing of steps (Shellsort) and dividing sorting (Quicksort) are described. In context of these algorithms, I deal with syntaxes and also effectiveness, with which they are able to sort the given system. Criteria of effectiveness are comparison and movement calculations, which are the function of only one parameter – the number of members in the system.
|
|
|
Sorting algorithms
Lýsek, Jiří ; Šeda, Miloš (referee) ; Dvořák, Jiří (advisor)
This thesis deals with a problem of sorting arrays, which is one of known problems in computer science. It defines concepts of sorting, algorithm and algorithm complexity. It describes sorting algorithms from the easiest ones to the selected more difficult methods. Finally, the algorithms are compared according to number of needed operations and time needed for the whole sorting process.
|
guest ::
