• DocumentCode
    3315276
  • Title

    A bi-partitioned insertion algorithm for sorting

  • Author

    Tiwari, Tarun ; Singh, Sweetesh ; Srivastava, Rupesh ; Kumar, Neerav

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Motilal Nehru Nat. Inst. of Technol., Allahabad, India
  • fYear
    2009
  • fDate
    8-11 Aug. 2009
  • Firstpage
    139
  • Lastpage
    143
  • Abstract
    It is known that insertion sort performs better on almost sorted arrays than other O(n2 ) sorting algorithms. In this paper we develop a bi-partitioned insertion algorithm for sorting, which out beats all other O(n2 ) sorting algorithms in general cases. The graphs of total time taken by different sorting algorithms confirm the superiority of our algorithm over other existing similar algorithms. We also prove the correctness of the algorithm and give a detailed time complexity analysis of the algorithm.
  • Keywords
    computational complexity; sorting; bipartitioned insertion algorithm; sorting algorithm; time complexity analysis; Algorithm design and analysis; Computer science; Partitioning algorithms; Sorting;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Information Technology, 2009. ICCSIT 2009. 2nd IEEE International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-4519-6
  • Electronic_ISBN
    978-1-4244-4520-2
  • Type

    conf

  • DOI
    10.1109/ICCSIT.2009.5234731
  • Filename
    5234731
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3315276