Thumbnail
Access Restriction
Subscribed

Author Pal, Rajat K.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Graph ♦ Satellite data ♦ Comparison sort ♦ Record ♦ Algorithm ♦ Complexity ♦ Sorting
Abstract Sorting is a well-known problem frequently used in many aspects of 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 paper, we propose a graph based comparison sorting algorithm, designated as RKPianGraphSort, that takes time $Θ(n^{2})$ in the worst-case, where n is the number of records in the given list to be sorted.
Description Affiliation: Department of Computer Science and Engineering, University of Calcutta, Kolkata, India (Pal, Rajat K.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2015-06-29
Publisher Place New York
Journal Ubiquity (UBIQ)
Volume Number 2007
Issue Number October
Page Count 16
Starting Page 1
Ending Page 16


Open content in new tab

   Open content in new tab
Source: ACM Digital Library