期刊文献+

An Only-Once-Sorting Algorithm

An Only-Once-Sorting Algorithm
下载PDF
导出
摘要 This paper provides a new sorting algorithm called 'Only-Once-Sorting' algorithm a mathemati cal formula,this algorithm can put elements in the positions they should be stored only once,then compacts them.The algorithm completes sorting a sequence of n elements in a calculation time of O(n ). This paper provides a new sorting algorithm called 'Only-Once-Sorting' algorithm a mathemati cal formula,this algorithm can put elements in the positions they should be stored only once,then compacts them.The algorithm completes sorting a sequence of n elements in a calculation time of O(n ).
出处 《Wuhan University Journal of Natural Sciences》 CAS 1996年第1期38-41,共4页 武汉大学学报(自然科学英文版)
关键词 mathematical formula onlv-once-sorting sorting algorithm mathematical formula,onlv-once-sorting,sorting algorithm
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部