National Repository of Grey Literature 3 records found  Search took 0.01 seconds. 
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
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.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.