Results 311 to 320 of about 5,697,479 (365)
Some of the next articles are maybe not open access.
This article presents a detailed analysis of sorting algorithms, highlighting their implementations, efficiencies and practical applications. Through extensive benchmarking with datasets of varying sizes (10,000 to 100,000 elements) and characteristics (random, partially ordered, reverse ordered), we demonstrate that hybrid algorithms like Timsort ...
openaire +1 more source
openaire +1 more source
Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment, 1996
Abstract Several new algorithms for sorting of dipole and/or quadrupole magnets in synchrotrons and storage rings are described. The algorithms make use of a combinatorial approach to the problem and belong to the class of random search algorithms. They use an appropriate metrization of the state space. The phase-space distortion (smear) is used as a
openaire +1 more source
Abstract Several new algorithms for sorting of dipole and/or quadrupole magnets in synchrotrons and storage rings are described. The algorithms make use of a combinatorial approach to the problem and belong to the class of random search algorithms. They use an appropriate metrization of the state space. The phase-space distortion (smear) is used as a
openaire +1 more source
1984
Publisher Summary This chapter presents a survey on various parallel sorting algorithms. Sorting is a nontrivial problem and has widespread commercial and business applications. Serial algorithms for sorting have been available since the days of punched-card machines. At present, there is a considerable body of literature on serial sorting algorithms.
S. Lakshmivarahan +2 more
openaire +1 more source
Publisher Summary This chapter presents a survey on various parallel sorting algorithms. Sorting is a nontrivial problem and has widespread commercial and business applications. Serial algorithms for sorting have been available since the days of punched-card machines. At present, there is a considerable body of literature on serial sorting algorithms.
S. Lakshmivarahan +2 more
openaire +1 more source
2017
Sorting algorithm remained hot topic in computer science from the birth of computer science to achieve maximum performance. Fortunately this achievement became possible due to good and fast sorting algorithms, such as heap sort, merge sort, radix sort and other sorting algorithms.
Adeel Ahmed +5 more
openaire +1 more source
Sorting algorithm remained hot topic in computer science from the birth of computer science to achieve maximum performance. Fortunately this achievement became possible due to good and fast sorting algorithms, such as heap sort, merge sort, radix sort and other sorting algorithms.
Adeel Ahmed +5 more
openaire +1 more source
Survey of GPU Based Sorting Algorithms
International journal of parallel programming, 2018D. Singh +2 more
semanticscholar +1 more source
2022 International Conference on Cyber Resilience (ICCR), 2022
Aditya Thakkar +3 more
openaire +1 more source
Aditya Thakkar +3 more
openaire +1 more source
Impact of Programming Languages on Energy Consumption for Sorting Algorithms
Advances in Intelligent Systems and Computing, 2018Tej Bahadur Chandra +2 more
semanticscholar +1 more source
1993
Abstract In this section we will discuss one of the first parallel sorting algorithms to be developed. DEFINillON 3.1. A sequence of numbers will be called bitonic if either of the following two conditions is satisfied: It starts out being monotonically increasing up to some point and then becomes monotonically decreasing.
openaire +1 more source
Abstract In this section we will discuss one of the first parallel sorting algorithms to be developed. DEFINillON 3.1. A sequence of numbers will be called bitonic if either of the following two conditions is satisfied: It starts out being monotonically increasing up to some point and then becomes monotonically decreasing.
openaire +1 more source