Ways to improve algorithmic understanding of sorting methods while studying the “Algorithms and data structures” course by the university students

Abstract

The paper considers peculiarities of the material teaching while learning algorithms of data sorting in terms of the “Algorithms and Data Structures” course and the ways to reduce possible complexities while its mastering. Active progress of software and information systems towards the formation of their convergent and hyper-convergent modifications results in rapid development of the amount of all types of interconnected data. Along with that, there is still a constantly reported burning problem as for catastrophic lack of high-skilled specialists in all computing spheres including the data processing one. A competence of IT-specialists is based on the ability of solving various algorithmic problems that they have not met before. One of the most widespread problems is the necessity in data sorting. Consequently, it is proposed to consider the ways to improve algorithmic understanding of sorting methods in terms of the “Algorithms and Data Structures” course and possible methods for reducing the complexity while its studying.