In 1960, K. A. Hoar developed the method of quick sorting of information, which became the most famous. Today it is widely used in programming, as it has a lot of positive properties: it can be used for general cases, requires a small increase in additional memory, is compatible with different types of lists, and is convenient for implementation. But there are also disadvantages that quick sorting has: when used in a job, many errors are made and it is somewhat unstable.
However, this is the most studied version. After the appearance of the first calculations of Hoar, many began to study it closely. A large base was created on the theoretical issues of finding the time spent on work, which was supported by empirical data. There were real suggestions for improving the basic algorithm and increasing the speed of work.
, . TList.Sort, ( 1) Delphi, , , qsort C++.
" ". . , , : . , , . , . – . , , . , , , : ) ; ) .
. , . . , . – . , . , , , .
, , . . : , , , . : . , . . . .
At this stage of the partitioning algorithm, which contains quick sorting, two situations can arise. The first is that the index on the left will be less than the right. This indicates an error, that is, the items that were pointed to are in the list in the wrong order. The way out is to change their places. The second situation is when both columns are equal or intersected. This indicates a successful separation of the list, that is, the work can be considered finished.