No Detail Found!

Decremental Sorting Algorithm: A Non-Comparison Sorting Technique

Author(s)
M. Imran Mushtaque Institute of Computer Science, Shah Abdul Latif University, Khairpur, Sindh, Pakistan
Shahid Ali Mahar Institute of Computer Science, Shah Abdul Latif University, Khairpur, Sindh, Pakistan
Mohammad Kashif Institute of Computer Science, Shah Abdul Latif University, Khairpur, Sindh, Pakistan
Muhammad Irshad Nazeer Department of Computer Science, Sukkur IBA University,Sindh,Pakistan
Abstract
Data is the fundamental element in computer science. We have to manipulate data as per our need. While working with data, we used to perform many operations. Sorting of data is one the very important problem. Many sorting algorithms have been proposed, that are categorized in two classes: comparison based sorting algorithms and non-comparison sorting algorithms. This paper discusses some of the well-known sorting algorithms and also proposes a new sorting technique which is non-comparison sorting technique, whereas its complexity is O (N.M), which is better than some well know sorting algorithms.
Publication Details
Page(s) 14-22
DOI DOI not available
Published Journal: University of Sindh Journal of Information and Communication Technology, Volume: 7, Issue: 1, Year: 2023

Request the full text from PASTIC

Keywords
Sorting, non-comparison sorting, Sorting Algorithm, comparison based sorting
More from University of Sindh Journal of Information and Communication Technology
0

Citations

0

Downloads

54

Views

Copyright ©  PASTIC National Center, Islamabad www.pastic.gov.pk