排序算法
合并排序
计算机科学
合并算法
分类
分类
合并(版本控制)
算法
实施
并行计算
范围(计算机科学)
时间复杂性
理论计算机科学
程序设计语言
数据库
作者
R Vignesh,Tribikram Pradhan
标识
DOI:10.1109/icaccct.2016.7831730
摘要
This paper aims at introducing a new sorting algorithm which sorts the elements of an array In Place. This algorithm has O(n) best case Time Complexity and O(n log n) average and worst case Time Complexity. We achieve our goal using Recursive Partitioning combined with In Place merging to sort a given array. A comparison is made between this particular idea and other popular implementations. We finally draw out a conclusion and observe the cases where this outperforms other sorting algorithms. We also look at its shortcomings and list the scope for future improvements that could be made.
科研通智能强力驱动
Strongly Powered by AbleSci AI