Results 161 to 170 of about 49,362 (204)
Some of the next articles are maybe not open access.
ACM Computing Surveys, 1971
The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years. The basic ideas presented here have been abstracted from this body of work, and the best algorithms known are given as examples.
openaire +2 more sources
The bibliography appearing at the end of this article lists 37 sorting algorithms and 100 books and papers on sorting published in the last 20 years. The basic ideas presented here have been abstracted from this body of work, and the best algorithms known are given as examples.
openaire +2 more sources
ACM SIGCSE Bulletin, 2008
Ronald Baecker's Sorting Out Sorting (SOS) set the stage for much of what has followed in the evolution of algorithm visualization (AV). That period of evolution has now spanned over a quarter century, and we have learned much about how to effectively use AV.
David Furcy +2 more
openaire +1 more source
Ronald Baecker's Sorting Out Sorting (SOS) set the stage for much of what has followed in the evolution of algorithm visualization (AV). That period of evolution has now spanned over a quarter century, and we have learned much about how to effectively use AV.
David Furcy +2 more
openaire +1 more source
SSRN Electronic Journal, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ayça Kaya, Galina Vereshchagina
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ayça Kaya, Galina Vereshchagina
openaire +1 more source
2013
Keeping items in order is at the essence of organizing information. This paper derives an information theoretic method for approximate sorting. It is optimal in the sense that it extracts as much reliable order information as possible from possibly noisy comparison input data.
Busse Ludwig M. +2 more
openaire +1 more source
Keeping items in order is at the essence of organizing information. This paper derives an information theoretic method for approximate sorting. It is optimal in the sense that it extracts as much reliable order information as possible from possibly noisy comparison input data.
Busse Ludwig M. +2 more
openaire +1 more source
Journal of Algorithms, 1998
Summary: This paper develops a simple and practical hybrid of MergeSort and QuickSort, called Quadripartite Sort. We first divide a sequence into two blocks, and sort one block on the right, then transform two blocks into four blocks such that the maximal element of the leftmost two blocks is less than or equal to the minimal element of the two ...
openaire +2 more sources
Summary: This paper develops a simple and practical hybrid of MergeSort and QuickSort, called Quadripartite Sort. We first divide a sequence into two blocks, and sort one block on the right, then transform two blocks into four blocks such that the maximal element of the leftmost two blocks is less than or equal to the minimal element of the two ...
openaire +2 more sources
Rainbow Sort: Sorting at the Speed of Light
Natural Computing, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
IEEE Transactions on Computers, 1985
The problem of sorting a file distributed over a number of sites of a communication network is examined. Two versions of this problem are investigated; distributed solution algorithms are presented; and their communication complexity analyzed both in the worst and in the average case.
Doron Rotem +2 more
openaire +2 more sources
The problem of sorting a file distributed over a number of sites of a communication network is examined. Two versions of this problem are investigated; distributed solution algorithms are presented; and their communication complexity analyzed both in the worst and in the average case.
Doron Rotem +2 more
openaire +2 more sources
The Journal of Finance, 1997 In this paper we analyze the theoretical implications of sorting data into groups and then running asset pricing tests within each group. We show that the way this procedure is implemented introduces a bias in favor of rejecting the model under consideration.
openaire +1 more source
Using SORT, sorting directories, sorting a file
1989In this lesson you will learn to: * use the SORT command * sort directories * sort files One of the most useful tasks a computer can do is to sort data into order. This data can be of any type: alphabetic, numeric or a mixture of both.
openaire +1 more source
A variant of Bucket Sort Shell Sort vs Insertion Sort
2019 10th International Conference on Computing, Communication and Networking Technologies (ICCCNT), 2019Sorting is a technique to rearrange a given list of elements according to a comparison operator on the elements. There are a large number of Sorting Algorithms like Insertion Sort, Merge Sort, Bucket Sort, Shell Sort, etc. The efficiency of the sorting algorithm depends on many factors such as memory usage patterns (the number of times the sections of ...
Abhay Goel +2 more
openaire +1 more source