Download PDFOpen PDF in browser


EasyChair Preprint no. 8081

8 pagesDate: May 24, 2022


Sorting is one of the most studied topics in computer science. It is the technique of arranging any group of entities such as elements of an array in a particular sequence usually in ascending or descending order. In recent times such a technique is widely used to query large database systems, which may be the requirement of an end-user or the data is needed in a sorted manner as an input to another algorithm or a system. In this paper, we propose a new sorting algorithm that performs well in some cases and comparable in others against baseline algorithms that are known to be the benchmarks in this field of study. The aim of the proposed algorithm is to sort an array of n elements. The proposed algorithm is known as Pointed-Sort with best and worst-case time complexity of N and N(LogN)respectively.

Keyphrases: pointers, sorting, space complexity, time complexity

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
  author = {Armaan Garg and Shashi Shekhar Jha},
  title = {Pointed-Sort},
  howpublished = {EasyChair Preprint no. 8081},

  year = {EasyChair, 2022}}
Download PDFOpen PDF in browser