Třídění na externím uložišti

Abstract

The aim of this thesis is to describe the problem of data sorting whose size is larger than the main memory. Familiarize with known algorithms, their shortcomings and subsequent optimization, design component for sorting the data using these algorithms. This component implemented in C++ over the structure of the implemented persistent array and consequently they are tested, respectively. further optimize.