Abstract: The ordering of items of an array/list in a certain sequence is one of the crucial topics in computer science. Sorting algorithms determines the new order of elements in a data structure ...

GPU-based sorting algorithms have emerged as a crucial area of research due to their ability to harness the immense parallel processing power inherent in modern graphics processing units. By ...

Bucket sort and radix sort work using a distribute and collect approach without making comparisons. In appropriate use cases, these can be faster than \mathcal{O}(n \log n) algorithms like quicksort ...

Abstract: The exploration of utilizing reconfigurable circuits with parallel computing capabilities has been conducted to enhance sorting performance and reduce power consumption. However, most ...

This function generates a random integer between a specified minimum and maximum value (inclusive). @param min The minimum value (inclusive) for the generated random number. @param max The maximum ...

This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a ...

School of Computer Science and Technology, Shanghai University of Electric Power, Shanghai, China. Counting sort is a linear time complexity sorting algorithm, first proposed by Harold H. Seward in ...