本程序通过编写五种不同的排序算法，以实现对算法时间复杂度的感性认识，程序可以对任意的一串数据进行从小到大的自然排序。而本程序以随机的数作为了待排数据，更体现了算法的全面性。-procedures through the preparation of the five different sorting algorithm to achieve the right time complexity of the algorithm was an agile and procedures can be arbitrary string of data from small to large natural order. And the procedures for the random number, as a row of data to be more shows that the algorithm comprehensive.