Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Efficient Data Sorting Introducing a New Method

Version 1 : Received: 8 September 2021 / Approved: 9 September 2021 / Online: 9 September 2021 (10:56:57 CEST)

How to cite: Devidas, R.; Kulkarni, A. Efficient Data Sorting Introducing a New Method. Preprints 2021, 2021090174 (doi: 10.20944/preprints202109.0174.v1). Devidas, R.; Kulkarni, A. Efficient Data Sorting Introducing a New Method. Preprints 2021, 2021090174 (doi: 10.20944/preprints202109.0174.v1).

Abstract

The efficiency of data sorting algorithms is the key aspect which determines the speed of data processing and searching. The best known efficiency of sorting algorithm has been Log (N) if there are N terms. All of the well-known sorting algorithms use various techniques to sort data. The basis for most of these are comparing the data terms with each other. In this manuscript, we are introducing a new approach for sorting data. This method is postulated to have the highest efficiency ever achieved by any of the sorting algorithms. We achieve this by sorting data without comparing the data terms. Or achieving results of data comparison without comparing the terms explicitly.

Keywords

Efficient sorting; Reconfigurable computing; Hardware optimization; Sorting through hardware re-configuration; new computer architecture for sorting; quantum inspired computer architecture

Subject

MATHEMATICS & COMPUTER SCIENCE, General & Theoretical Computer Science

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.