RESEARCH METHODS FOR SORTING DATA VALUES
The choice of a sorting algorithm is usually determined by the complexity of its implementation and the time spent on sorting. For real-time systems, sorting time is of paramount importance, but the capabilities of hardware, especially limited in the amount of random-access memory, microcontrollers, do not always allow the implementation of complex algorithms. The paper considers several data sorting algorithms that belong to different classes of sorting methods. The complexity of the implementation of various algorithms is shown, the program code in C is given. When conducting a computational experiment, the sorting time for various data sets was determined. It is shown that the quick sort algorithm proved to be the most effective for sorting large data arrays