首页    期刊浏览 2024年10月06日 星期日
登录注册

文章基本信息

  • 标题:Proposal of a Two Way Sorting Algorithm and Performance Comparison with Existing Algorithms
  • 本地全文:下载
  • 作者:Eshan Kapur ; Parveen Kumar ; Sahil Gupta
  • 期刊名称:International Journal of Computer Science, Engineering and Applications (IJCSEA)
  • 印刷版ISSN:2231-0088
  • 电子版ISSN:2230-9616
  • 出版年度:2012
  • 卷号:2
  • 期号:3
  • 出版社:Academy & Industry Research Collaboration Center (AIRCC)
  • 摘要:An algorithm is any well-defined procedure or set of instructions, that takes some input in the form of some values, processes them and gives some values as output. Sorting involves rearranging information into either ascending or descending order. Sorting is considered as a fundamental operation in computer science as it is used as an intermediate step in many operations. A new sorting algorithm namely ‘An Endto- End Bi-directional Sorting (EEBS) Algorithm’ is proposed to address the shortcomings of the current popular sorting algorithms. The goal of this research is to perform an extensive empirical analysis of the newly developed algorithm and present its functionality. The results of the analysis proved that EEBS is much more efficient than the other algorithms having O(n2) complexity, like bubble, selection and insertion sort.
  • 关键词:An algorithm is any well-defined procedure or set of instructions; that takes some input in the form of some;values; processes them and gives some values as output. Sorting involves rearranging information into;either ascending or descending order. Sorting is considered as a fundamental operation in computer;science as it is used as an intermediate step in many operations. A new sorting algorithm namely ‘An Endto-;End Bi-directional Sorting (EEBS) Algorithm’ is proposed to address the shortcomings of the current;popular sorting algorithms. The goal of this research is to perform an extensive empirical analysis of the;newly developed algorithm and present its functionality. The results of the analysis proved that EEBS is;much more efficient than the other algorithms having O(n2) complexity; like bubble; selection and insertion;sort.
国家哲学社会科学文献中心版权所有