What is it about?
It is about Sorting big records with less execution time.
Featured Image
Photo by Sophie Elvis on Unsplash
Why is it important?
To sort thousands of records either sorted or unsorted, traditional sorting approaches can be used. In those cases, we can ignore the complexities as very minute difference exists in their execution time. But in case the data are very large, where execution time or processed time of billion or trillion of records is very large, we cannot ignore the complexity at this situation; therefore, an optimized sorting approach is required.
Perspectives
I am very happy to discover an optimal approach for sorting with less execution time as compared to other sorting algorithms.
Dr Mohammad Shabaz
Model Institute of Engineering and Technology
Read the Original
This page is a summary of: SA Sorting: A Novel Sorting Technique for Large-Scale Data, Journal of Computer Networks and Communications, January 2019, Hindawi Publishing Corporation,
DOI: 10.1155/2019/3027578.
You can read the full text:
Contributors
The following have contributed to this page
