ARC Sort: Enhanced and Time Efficient Sorting Algorithm

TL;DR

This paper introduces ARC Sort, a bucket-based sorting algorithm that improves efficiency by reducing comparisons through digit-based bucketing, leading to faster sorting times.

Contribution

The paper presents a novel digit-based bucketing approach that enhances sorting efficiency by minimizing unnecessary comparisons.

Findings

Reduces sorting time complexity significantly

Uses a two-dimensional data structure for bucket management

Eliminates comparisons between buckets

Abstract

This paper discusses about a sorting algorithm which uses the concept of buckets where each bucket represents a certain number of digits. A two dimensional data structure is used where one dimension represents buckets i. e; number of digits and each bucket's corresponding dimensions represents the input numbers that belong to that bucket. Each bucket is then individually sorted. Since every preceding bucket elements will always be smaller than the succeeding buckets no comparison between them is required. By doing this we can significantly reduced the time complexity of any sorting algorithm used to sort the given set of inputs.