摘 要
随着计算机科学技术的不断提高和发展，其强大的运算功能已经逐渐融入人类社会的各个领域，并且在各个领域中发挥越来越重要的作用。当然，高效的运算速度并不代表无限快，在有限的资源空间里，要大大提高运算处理数据的速率，就需要我们使用那些在时间和空间上体现出高效的算法。本系统是为了演示在同一问题上，不同的算法在效率上存在的巨大差异。本系统采用Visual C++ 6.0中文版为开发工具，实现三种不同排序算法，即：冒泡排序算法、选择排序算法和快速排序算法，以及这三种排序对同一问题的处理并且以图形的形式给出快慢比较，实现排序算法的动态演示。其目的是为了让我们在使用计算机处理规模越来越大的数据问题上，能够清楚什么样的算法适合当前的处理系统。
关键词：Visual C++；排序算法；动态演示The Design and Development of Dynamic Sorting Algorithm Demo
Abstract
With computer science and technology improvement and development, its powerful computing has gradually integrate into human society in various fields, and play an increasingly important role. Of course, efficient computational speed does not mean unlimited fast, and the limited resources of space, Operators must significantly improve processing speed, we need to use the time and space reflects efficient algorithms. The system is to demonstrate on the same issues in different algorithm efficiency in the enormous difference. The system uses Visual C ++6.0 for the development of the Chinese version of tools to achieve three different sorting algorithms, namely : The Bubble Sorting Algorithm, The Select Sorting Algorithm and The Quick Sorting Algorithm, and three ranking on the same issue to deal with and the graphics are presented in the form of speed, Sorting Algorithm to achieve the dynamic presentation. Its purpose is that enable us to use computers to handle the increasingly large scale data problems, to know what kind of algorithm is suitable for the current system.
Key words: Visual C ++ ; Sorting Algorithm; Dynamic Demonstration
