Results 1 
6 of
6
Topdown Synthesis of Sorting Algorithms
, 1992
"... Traditionally sorting algorithms are classified according to their main operational characteristic, rather than their underlying logic. More recent work in program synthesis has exposed the logic of and hence the logical relationships between some sorting algorithms. Following the program synthesis ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Traditionally sorting algorithms are classified according to their main operational characteristic, rather than their underlying logic. More recent work in program synthesis has exposed the logic of and hence the logical relationships between some sorting algorithms. Following the program synthesis approach, and by using a logic programming system for deriving recursive logic procedures from their specifications, we have synthesised a large family of sorting algorithms in a strictly topdown manner. Such an approach not only produces algorithms which are guaranteed to be partially correct, it also provides a family tree showing clearly the relationships between its members. This paper contains c.4500 words, 15 pages, and 1 diagram. 1 Introduction Traditionally, algorithms are "discovered" first, and then proved correct. Sorting algorithms are no exception. More recently, work in program synthesis has been applied to the derivation of algorithms from their specifications. The main adva...
Pbit and other list sorting algorithms
 Cornell University Computing and Information Science Technical Reports, 2006. [Online]. Available: http://arxiv.org/abs/cs.DS/0511020
"... Pbit, besides its simplicity, is definitely the fastest list sorting algorithm. It considerably surpasses all already known methods. Among many advantages, it is stable, linear and be made to run in place. I will compare Pbit with algorithm described by Donald E. Knuth [8] in the third volume of “Th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Pbit, besides its simplicity, is definitely the fastest list sorting algorithm. It considerably surpasses all already known methods. Among many advantages, it is stable, linear and be made to run in place. I will compare Pbit with algorithm described by Donald E. Knuth [8] in the third volume of “The Art of Computer Programming ” and other list sorting algorithms. 1 Introduction to lists A Lists is a set of independent data formats, very often called nodes. Particular nodes are connected with each other by means of pointers. Nodes are usually created dynamically, which is good for economical use of memory. We will deal with singlylinked lists because Pbit was created for such type of lists (which
A Historical Perspective and Empirical Study
"... Abstract — In this paper a comprehensive survey and empirical study of the Quicksort algorithm is provided. The survey examines in detail all the different variations of Quicksort starting with the original version developed by Hoare in 1961 and ending with some of the most recent ones. The paper al ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract — In this paper a comprehensive survey and empirical study of the Quicksort algorithm is provided. The survey examines in detail all the different variations of Quicksort starting with the original version developed by Hoare in 1961 and ending with some of the most recent ones. The paper also investigates some new sorting algorithms and compares their performances to the various versions of Quicksort. The study compared each algorithm in terms of the number of comparisons performed and the running times when used for sorting arrays of integers that were already sorted,
Comparative Performance Evaluation of HeapSort and QuickSort Algorithms
"... Sorting is a fundamental operation in computer science (many programs use it as an intermediate step). A large number of sorting algorithms have been made in order to have a best performance in terms of computational complexity (best, average and worst), memory usage, stability and method. One of so ..."
Abstract
 Add to MetaCart
(Show Context)
Sorting is a fundamental operation in computer science (many programs use it as an intermediate step). A large number of sorting algorithms have been made in order to have a best performance in terms of computational complexity (best, average and worst), memory usage, stability and method. One of sorting algorithms can perform much better than another. For that, we intend to make a comparison research paper and two representative algorithms were chosen to show these differences. In the paper, a comparative performance evaluation of two sorting algorithms HeapSort and QuickSort will be presented depending on the performance factors shown above. Furthermore, the most significant enhancements of these algorithms will be discussed.