Results 221 to 230 of about 216,568 (279)
Some of the next articles are maybe not open access.
New Sorting Algorithm—RevWay Sort
2021Sorting provides a method of rearrangement of elements in ascending or descending order. In this paper, we are introducing a new sorting algorithm called RevWay sort in which the two consecutive numbers are compared from left and then from right. This process is repeated \(((n/2)+1)\) times, where n is the total number of elements.
Swarna Saha +3 more
openaire +1 more source
Lexical Permutation Sorting Algorithm
The Computer Journal, 1997Summary: The block sorting lossless data compression algorithm (BWT) described by Burrows and Wheeler has received considerable attention. Its compression rates are similar to context-based methods, such as PPM, but at execution speeds closer to Ziv-Lempel techniques.
Arnavut, Ziya, Magliveras, Spyros S.
openaire +2 more sources
2018 3rd International Conference for Convergence in Technology (I2CT), 2018
Sorting algorithms are a major area of research in computer science and engineering where the simple task of sorting the numbers leads to complex algorithms. In recent years, many researchers have proposed several sorting techniques to enhance time and space complexities of the algorithms.
openaire +1 more source
Sorting algorithms are a major area of research in computer science and engineering where the simple task of sorting the numbers leads to complex algorithms. In recent years, many researchers have proposed several sorting techniques to enhance time and space complexities of the algorithms.
openaire +1 more source
Optimizing sorting algorithms by using sorting networks
Formal Aspects of Computing, 2017Abstract In this paper, we show how the theory of sorting networks can be applied to synthesize optimized general-purpose sorting libraries. Standard sorting libraries are often based on combinations of the classic Quicksort algorithm, with insertion sort applied as base case for small, fixed, numbers of inputs.
Michael Codish +3 more
openaire +3 more sources
Bicomponent sorting algorithms
PROBLEMS IN PROGRAMMING, 2022he possibilities of improving sorting time parameters through preprocessing by stochastic sorting were investigated. The hypothesis that two-component stochastic + classical sorting outperforms classic one-component sorting in terms of time efficiency was experimentally confirmed. Sorting with different computational complexity is accepted as classical
V. I. Shynkarenko +4 more
openaire +1 more source
Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019
For many years, beginning computer science students have been asked the seemingly simple question: what makes one algorithm better than another? Usually, this concept of "best-ness" is introduced with the many algorithms that are used to sort data. Thus, students are overwhelmed by the intricacies of sorting while simultaneously trying to understand ...
Connor Bain, Uri Wilensky
openaire +1 more source
For many years, beginning computer science students have been asked the seemingly simple question: what makes one algorithm better than another? Usually, this concept of "best-ness" is introduced with the many algorithms that are used to sort data. Thus, students are overwhelmed by the intricacies of sorting while simultaneously trying to understand ...
Connor Bain, Uri Wilensky
openaire +1 more source
2009 Second International Conference on Computer and Electrical Engineering, 2009
Sorting is an important concept in the field of Computer Sciences. In this paper we presents an incremental sorting algorithm, which traverses the list in both directions (right and left) comparing first element of the list, with next two elements, and comparing last element with previous two elements in the list.
Sardar Zafar Iqbal +2 more
openaire +1 more source
Sorting is an important concept in the field of Computer Sciences. In this paper we presents an incremental sorting algorithm, which traverses the list in both directions (right and left) comparing first element of the list, with next two elements, and comparing last element with previous two elements in the list.
Sardar Zafar Iqbal +2 more
openaire +1 more source