• DocumentCode
    3033746
  • Title

    Indexed Array Algorithm for Sorting

  • Author

    Bansal, Varinder Kumar ; Srivastava, Rupesh ; Pooja

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Motilal Nehru Nat. Inst. of Technol., Allahabad, India
  • fYear
    2009
  • fDate
    28-29 Dec. 2009
  • Firstpage
    34
  • Lastpage
    36
  • Abstract
    In this paper we present a sorting algorithm, which uses the methodology of indexing in insertion sort efficiently to give a much better performance than the existing sorting algorithms of the O(n2) class. We prove the correctness of the algorithm, detailed time complexity analysis and applications of the algorithm.
  • Keywords
    algorithm theory; computational complexity; sorting; indexed array algorithm; sorting algorithm; time complexity analysis; Algorithm design and analysis; Computer science; Educational institutions; Indexing; Sorting; Telecommunication computing; Telecommunication control; algorithm; indexed; insertion; selection; sorting;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Advances in Computing, Control, & Telecommunication Technologies, 2009. ACT '09. International Conference on
  • Conference_Location
    Trivandrum, Kerala
  • Print_ISBN
    978-1-4244-5321-4
  • Electronic_ISBN
    978-0-7695-3915-7
  • Type

    conf

  • DOI
    10.1109/ACT.2009.18
  • Filename
    5376871
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3033746