Array sort: an adaptive sorting algorithm on multi‐thread
نویسندگان
چکیده
منابع مشابه
Bead-Sort: A Natural Sorting Algorithm
Nature is not only a source of minerals and precious stones but is also a mine of algorithms. By observing and studying natural phenomena, computer algorithms can be extracted. In this note, a simple natural phenomenon is used to design a sorting algorithm for positive integers, called here Bead–Sort. The algorithm’s run– time complexity ranges from O(1) to O(S) (S is the sum of the input integ...
متن کاملBinar Sort: A Linear Generalized Sorting Algorithm
Sorting is a common and ubiquitous activity for computers. It is not surprising that there exist a plethora of sorting algorithms. For all the sorting algorithms, it is an accepted performance limit that sorting algorithms are linearithmic or O(N lg N). The linearithmic lower bound in performance stems from the fact that the sorting algorithms use the ordering property of the data. The sorting ...
متن کاملMatrix Sort - A Parallelizable Sorting Algorithm
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 eleme...
متن کاملAn Adaptive Generic Sorting Algorithm that
A sorting algorithm is adaptive if its run time for inputs of the same size n varies smoothly from O(n) to O(n logn) as the disorder of the input varies. It is well accepted that les that are already sorted are often sorted again and that many les occur naturally in nearly sorted state. Recently, researchers have focused their attention on sorting algorithms that are optimally adaptive with res...
متن کاملAn Adaptive Generic Sorting Algorithm that Uses
A sorting algorithm is adaptive if its run time, for inputs of the same size n, varies smoothly from O(n) to O(n logn) as the disorder of the input varies. It is well accepted that les that are already sorted are often sorted again and that nearly sorted les often occur. Recently, researchers have focused their attention on sorting algorithms that are optimally adaptive with respect to several ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Engineering
سال: 2019
ISSN: 2051-3305,2051-3305
DOI: 10.1049/joe.2018.5154