Sorting algorithms

Enormous volume of data, which has been processed during production operations, requires easy orientation and quick searching. Exact search in real time is essential for success. Correct and quick data-sorting is one of the most important activity during dataprocessing. The goal of this bachelor’s thesis is background research of sorting algorithms. To achieve the goal, basic concepts of sorting theory will be described (determined) and there will be division of sorting algorithms by different criterions. For each algorithm of internal array sorting, sorting principles will be described and analysis of efficiency will be provided. The results will be verified by experimental program