插入排序算法优化  

Optimization of Insertion Sorting Algorithm

作　　者：汪红霞[1] 邵飞飞[2] 

机构地区：[1]安徽新华学院信息工程学院,安徽合肥230088 [2]安徽新华学院计算机科学与技术学院,安徽合肥230088

出　　处：《佳木斯大学学报（自然科学版）》2015年第5期736-738,共3页Journal of Jiamusi University：Natural Science Edition

摘　　要：当今时代,云计算与大数据越来越被人们所重视.算法的时间复杂度作为评估算法性能的最重要的因素之一,亟需得到改善和提高.而排序算法的优劣直接影响算法的运行速度.为了减少大数据和云计算算法的排序时间,提高排序算法运行的效率,对插入排序算法进行了优化.分别从随机获取无序区元素、分组、增量和设立标志位等方面进行优化,有效降低了插入排序算法的时间复杂度.实验结果表明,改进后的排序算法在排序效率上得到了很大提高.People pay more and more attention to cloud computing and big data nowadays, so that the time complexity of the algorithm, which is one of the most important factors to measure an algorithm, should be improved urgently. It is well known that the complexity of the sorting algorithm will affect the running speed of the algorithm directly. In order to reduce the time complexity of the sorting algorithm utilized in big data and cloud computing algorithms and improve the running efficiency of the sorting algorithms, the insertion sorting al- gorithm was optimized, in the aspects of getting random element from the disordered region, grouping, incremental and setting up flag bit. This method can reduce the time complexity of the insertion sorting algorithm effectively. The experiments show that the modified sorting algorithms improved a lot in the sorting efficiency.

关 键 词：插入排序算法 算法优化 排序效率 

分 类 号：TP39[自动化与计算机技术—计算机应用技术]