• DocumentCode
    2635049
  • Title

    ARKEPIanGraphSort: a graph based sorting algorithm

  • Author

    Pal, Rajat K.

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Calcutta Univ., India
  • Volume
    4
  • fYear
    2003
  • fDate
    15-17 Oct. 2003
  • Firstpage
    1386
  • Abstract
    Sorting is a well-known problem frequently used in many aspects of the world of computational application. Sorting means arranging a set of records (or a list of keys) in some (increasing or decreasing) order. In this paper, we propose a graph based sorting algorithm, designated as ARKEPIanGraphSort that takes time ⊗(n2) in the worst-case, where n is the number of records in the given list to be sorted.
  • Keywords
    computational complexity; graph theory; sorting; ARKEPIanGraphSort; graph based sorting algorithm; record set; Algorithm design and analysis; Computational complexity; Hydrogen; Out of order; Sorting; Stability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    TENCON 2003. Conference on Convergent Technologies for the Asia-Pacific Region
  • Print_ISBN
    0-7803-8162-9
  • Type

    conf

  • DOI
    10.1109/TENCON.2003.1273145
  • Filename
    1273145
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2635049