RKPianGraphSort: a graph based sorting algorithm

Authors:
Rajat K. Pal
Affiliations:
Department of Computer Science and Engineering, University of Calcutta, Kolkata, India
Venue:
Ubiquity
Year:
2007

Citing 5
Cited 0

Introduction to algorithms

Introduction to algorithms
Data structures and algorithm analysis in C

Data structures and algorithm analysis in C
Fundamentals of algorithmics

Fundamentals of algorithmics
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Quantified Score

Hi-index	0.00

Visualization

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 Θ(n2) in the worst-case, where n is the number of records in the given list to be sorted.