arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.02615cs.DS
收藏

双向条件插入排序算法经典插入排序算法的一个有效改进

Bidirectional Conditional Insertion Sort algorithm; An efficient progress on the classical insertion sort

Adnan Saher Mohammed, Şahin Emrah Amrahov, Fatih V. Çelebi

摘要:

本文提出了一种新的基于插入排序概念的高效排序算法。该算法被称为双向条件插入排序(BCIS)。它是原地排序算法,与经典的插入排序(IS)相比,它具有显著的有效的平均情况下的时间复杂度。通过比较我们提出的新算法与快速排序算法,BCIS表示更快的平均情况下,相对较小的大小数组高达1500个元素。此外,BCIS被观察到比Quicksort更快,即使对于大尺寸的数组,在高重复元素率。

英文摘要:

In this paper, we proposed a new efficient sorting algorithm based on insertion sort concept. The proposed algorithm called Bidirectional Conditional Insertion Sort (BCIS). It is in-place sorting algorithm and it has remarkably efficient average case time complexity when compared with classical insertion sort (IS). By comparing our new proposed algorithm with the Quicksort algorithm, BCIS indicated faster average case time for relatively small size arrays up to 1500 elements. Furthermore, BCIS was observed to be faster than Quicksort within high rate of duplicated elements even for large size array.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑