随着计算机科学技术的不断提高和发展，其强大的运算功能已经逐渐融入人类社会的各个领域，并且在各个领域中发挥越来越重要的作用。当然，高效的运算速度并不代表无限快，在有限的资源空间里，要大大提高运算处理数据的速率，就需要我们使用那些在时间和空间上体现出高效的算法。本系统是为了演示在同一问题上，不同的算法在效率上存在的巨大差异。本系统采用Visual C++ 6.0中文版为开发工具，实现三种不同排序算法，即：冒泡排序算法、选择排序算法和快速排序算法，以及这三种排序对同一问题的处理并且以图形的形式给出快慢比较，实现排序算法的动态演示。其目的是为了让我们在使用计算机处理规模越来越大的数据问题上，能够清楚什么样的算法适合当前的处理系统。

-With the continuous improvement and development of computer science and technology, its powerful computing capabilities have been gradually integrated into various areas of human society, and to play an increasingly important role in various fields. Of course, the efficient operation speed does not mean infinitely fast, in the limited space of resources to greatly improve the operation processing data rate, we need to use those that reflect the time and space efficient algorithms. This system is in the same issue, a different algorithm to demonstrate the huge difference in efficiency. Visual C++ 6.0 Chinese version of the system for the development of tools to achieve three different sorting algorithms: bubble sort, selection sort algorithm and fast sorting algorithm, as well as the three sort of the same problem in graphical form to the pace of comparison, the sorting algorithm to achieve the dynamic presentation. Its purpose is to let us in on the increasing scale of the data in the