A General Framework for Sorting Large Data Sets Using Independent Subarrays of Approximately Equal Length

A General Framework for Sorting Large Data Sets Using Independent Subarrays of Approximately Equal Length

Designing an efficient data sorting algorithm that requires less time and space complexity is essential for computer science, different engineering disciplines, data mining systems, wireless networks, and the Internet of things. This paper proposes a general low-complex data sorting framework that d...

Full description

Bibliographic Details
Main Authors: Shahriar Shirvani Moghaddam, Kiaksar Shirvani Moghaddam
Format: Article
Language:English
Published: IEEE 2022-01-01
Series:IEEE Access
Subjects:
Data sorting
Gaussian
integer
merge
multi-core
non-integer
Online Access:https://ieeexplore.ieee.org/document/9690854/

Internet

https://ieeexplore.ieee.org/document/9690854/

Similar Items