摘要
分析了选择排序、交换排序和插入排序三类算法,对直接选择排序、堆排序、冒泡排序、快速排序、直接插入排序和希尔排序算法进行了深入研究,论证了在最好情况、平均情况和最坏情况下这些算法的时间复杂度。
Three kinds of algorithm were analyzed,and they ’ re select sort,exchange sort,insert sort.The paper makes a further research to the algorithm of direct select sort,heap sort,bubble sort,quick sort,direct insert sort,shell sort.The time complexity of these algorithms was proved in the best situation,and in average situation,and in the worst situation.
出处
《软件导刊》
2012年第6期35-38,共4页
Software Guide
