首页    期刊浏览 2022年01月20日 星期四
登录注册

文章基本信息

  • 标题:A COMPREHENSIVE NOTE ON COMPLEXITY ISSUES IN SORTING ALGORITHMS
  • 本地全文:下载
  • 作者:Parag Bhalchandra, Nilesh Deshmukh, Sakharam Lokhande, Santosh Phulari
  • 期刊名称:Advances in Computational Research
  • 印刷版ISSN:0975-3273
  • 电子版ISSN:0975-9085
  • 出版年度:2009
  • 期号:489
  • 页码:1-9
  • 出版社:Bioinfo Publications
  • 摘要:Since the dawn of computing, the sorting problem has attracted a great deal of research. In past, many researchers have attempted to optimize it properly using empirical analysis. We have investigated the complexity values researchers have obtained and observed that there is scope for fine tuning in present context. Strong evidence to that effect is also presented. We aim to provide a useful and comprehensive note to researcher about how complexity aspects of sorting algorithms can be best analyzed. It is also intended current researchers to think about whether their own work might be improved by a suggestive fine tuning. Our work is based on the knowledge learned after literature review of experimentation, survey paper analysis being carried out for the performance improvements of sorting algorithms. Although written from the perspective of a theoretical computer scientist, it is intended to be of use to researchers from all fields who want to study sorting algorithms rigorously.
国家哲学社会科学文献中心版权所有