ARC Sort: Enhanced and Time Efficient Sorting Algorithm

  • Chadha A
  • Misal R
  • Mokashi T
  • et al.
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Chadha, A., Misal, R., Mokashi, T., & Chadha, A. (2014). ARC Sort: Enhanced and Time Efficient Sorting Algorithm. International Journal of Applied Information Systems (IJAIS) - ISSN : 2249-0868. https://doi.org/10.5120/ijais14-451130

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free