• DocumentCode
    2282526
  • Title

    CompleteGraphSort: A complete graph structure based sorting algorithm

  • Author

    Pal, Rajat K.

  • Author_Institution
    Dept. of Inf. Technol., Assam Univ., Silchar, India
  • Volume
    4
  • fYear
    2011
  • fDate
    10-12 June 2011
  • Firstpage
    193
  • Lastpage
    197
  • Abstract
    Sorting is a well-known problem frequently used in many aspects in the world of computational applications. Sorting means arranging a set of records (or a list of keys) in some (increasing or decreasing) order. In this solution report, a complete graph structure based comparison sorting algorithm, CompleteGraphSort has been proposed 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; CompleteGraphSort; comparison sorting algorithm; complete graph structure; records arrangement; Algorithm; Comparison sort; Complexity; Graph; Record; Satellite data; Sorting;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Automation Engineering (CSAE), 2011 IEEE International Conference on
  • Conference_Location
    Shanghai
  • Print_ISBN
    978-1-4244-8727-1
  • Type

    conf

  • DOI
    10.1109/CSAE.2011.5952832
  • Filename
    5952832
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2282526