1. Matrix Sort - A Parallelizable Sorting Algorithm
- Author
-
V Vijay, A B Saketh, and S. Kavitha
- Subjects
Proxmap sort ,Sorting algorithm ,Selection sort ,Comparison sort ,Computer science ,02 engineering and technology ,Shellsort ,Adaptive sort ,0203 mechanical engineering ,0202 electrical engineering, electronic engineering, information engineering ,Worst-case complexity ,In-place algorithm ,sort ,Merge sort ,Timsort ,Time complexity ,Block sort ,Stooge sort ,020206 networking & telecommunications ,020302 automobile design & engineering ,Hybrid algorithm ,Merge algorithm ,Bucket sort ,Pigeonhole sort ,Counting sort ,Algorithm - Abstract
Sorting algorithms are the class of algorithms that result in the ordered arrangement of a list of given elements. The arrangement can be in ascending or descending order based on the requirement given. Time complexity, space complexity and optimality are used to assess the algorithms. In this paper, a new sorting algorithm called Matrix sort is introduced. This algorithm aims to sort the elements of a matrix without disturbing the matrix structure. It has a time complexity of O(n p nlog p n) and hence takes lesser time than existing O(n 2 ) algorithms. A pseudocode for the algorithm is provided and the best, average and worst case time complexities are derived.
- Published
- 2016