Rating: 3.75
|
Algorithms in a nutshell
Criteria for Choosing a Sorting Algorithm To choose a sorting algorithm,
consider the qualitative criteria in Table 4-6. These may help your initial ...
by George T. Heineman, Gary Pollice, Stanley Selkow
 view
Buy
|
|
Algorithms and computation, 14th international symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003 : proceedings
Three sorting algorithms using priority queues are introduced. The first
algorithm performs the same comparisons as the classical Mergesort algorithm,
...
by Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono
view
Buy
|
Rating: 5.00
|
Foundations of algorithms using Java pseudocode
Table 7.2 Analysis summary for (-) (n Ig n) sorting algorithms* 'Entries are
approximate; the average cases for Mergesort ...
by Richard E. Neapolitan, Kumarss Naimipour
view
Buy
|
Rating: 4.60
|
The algorithm design manual
4 Sorting and Searching Typical computer science students study the basic
sorting algorithms at least three times before they graduate: first in ...
by Steven S. Skiena
view
Buy
|
|
Proceedings of the 1993 International Conference on Parallel Processing, August 16-20, 1993: Algorithms & applications
Data movement is the major portion of sorting time for most algorithms in the
literature. ... The input to a sorting algorithm is a collection of records. ...
by P. Bruce Berra, Salim Hariri, Pennsylvania State University
view
Buy
|
|
Parallel algorithm derivation and program transformation
This paper carries through the salient parts of a formal derivation for a well-
known parallel sorting algorithm - Batcher's Even-Odd sort. ...
by Robert A. Paige, John H. Reif, R. F. Wachter
view
Buy
|
Rating: 4.00
|
Recursive algorithms
We will look at some of these later, but for now in order to develop a sound
perspective on what to expect from sorting algorithms let's find the complexity
...
by Richard Lorentz
view
Buy
|
|
Proceedings of the fifth annual ACM-SIAM Symposium on Discrete Algorithms
Many routing algorithms involve the sorting of subsets of the packets, while
many sorting algorithms use routing in intermediate steps of the computation.
...
by ACM Special Interest Group for Automata and Computability Theory
view
Buy
|
|
Algorithms -- ESA 2005, 13th annual European symposium, Palma de Mallorca, Spain, October 3-6, 2005 : proceedings
A 2-Approximation Algorithm for Sorting by Prefix Reversals Johannes Fischer and
Simon W. Ginzinger LFE Bioinformatik und Praktische Informatik, ...
by Stefano Leonardi
view
Buy
|
|
Algorithms--ESA 2007, 15th annual European symposium, Eilat, Israel, October 8-10, 2007 : proceedings
Integer sorting is used as a subroutine in a number of algorithms that deal with
... In Section 2, we present a stable integer sorting algorithm for O(logn) ...
by Lars Arge, Michael Hoffmann, Emo Welzl
view
Buy
|