.png){kind=icon}
返回
Bidirectional Conditional Insertion Sort algorithm; An efficient progress on the classical insertion sort
.png){kind=icon}
OA
AI
DOI：10.1016/j.future.2017.01.034.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we proposed a new efficient sorting algorithm based on insertion sort concept. The proposed algorithm is 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. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Insertion sort
Sorting
Quicksort
Bidirectional insertion sort
BCIS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.8K
被引数:
2.3W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容