Shellsort and Sorting Networks
Author | : Vaughan R. Pratt |
Publisher | : Dissertations-G |
Total Pages | : 88 |
Release | : 1979 |
Genre | : Computers |
ISBN | : |
Download Shellsort and Sorting Networks Book in PDF, ePub and Kindle
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Shellsort And Sorting Networks PDF full book. Access full book title Shellsort And Sorting Networks.
Author | : Vaughan R. Pratt |
Publisher | : Dissertations-G |
Total Pages | : 88 |
Release | : 1979 |
Genre | : Computers |
ISBN | : |
Author | : Vaughan R. Pratt |
Publisher | : |
Total Pages | : 140 |
Release | : 1972 |
Genre | : Electric networks |
ISBN | : |
Shellsort is a particular method of sorting data on digital computers. Associated with each variant of Shellsort is a sequence of integers that characterizes that variant. In the paper the author answers some open questions about the speed of Shellsort with certain characteristic sequences, and suggests a novel application of Shellsort, namely to sorting networks. Shellsort with any characteristic sequence that approximates a geometric progression and that has short coprime subsequences through takes O(n sup 3/2) units of time. For any sequence that approximates a geometric progression with an integer common ratio, this bound is the best possible. However, if the sequence consists of the descending sequence of positive integers less than n and having only 2 and 3 as prime factors, then Shellsort takes only O(n log squared n) units of time. Sorting networks based on Shellsort with this sequence operate approximately 1.5 times as fast as with previous methods. (Author).
Author | : Sherenaz W. Al-Haj Baddar |
Publisher | : Springer Science & Business Media |
Total Pages | : 132 |
Release | : 2012-02-02 |
Genre | : Computers |
ISBN | : 1461418518 |
Designing Sorting Networks: A New Paradigm provides an in-depth guide to maximizing the efficiency of sorting networks, and uses 0/1 cases, partially ordered sets and Haase diagrams to closely analyze their behavior in an easy, intuitive manner. This book also outlines new ideas and techniques for designing faster sorting networks using Sortnet, and illustrates how these techniques were used to design faster 12-key and 18-key sorting networks through a series of case studies. Finally, it examines and explains the mysterious behavior exhibited by the fastest-known 9-step 16-key network. Designing Sorting Networks: A New Paradigm is intended for advanced-level students, researchers and practitioners as a reference book. Academics in the fields of computer science, engineering and mathematics will also find this book invaluable.
Author | : University of Washington. Department of Computer Science |
Publisher | : |
Total Pages | : 10 |
Release | : 1989 |
Genre | : |
ISBN | : |
Author | : D. C. Van Voorhis |
Publisher | : |
Total Pages | : 90 |
Release | : 1971 |
Genre | : Sorting (Electronic computers) |
ISBN | : |
Author | : David Curtis Van Voorhis |
Publisher | : |
Total Pages | : 394 |
Release | : 1971 |
Genre | : Sorting (Electronic computers) |
ISBN | : |
Author | : Stanford University. Stanford Electronics Laboratories. Digital Systems Laboratory |
Publisher | : |
Total Pages | : 52 |
Release | : 1971 |
Genre | : Sorting (Electronic computers) |
ISBN | : |
Let M sub g (g sup(K+1)) represent the minimum number of comparators required by a network that merges g ordered sets containing g sup K members each. In the paper the author proves that M sub g(g(sup K+1))>or= g(m sub g)(g supK)+ the summation from i=2 to g of ((i-1)g/i). From this relation the author is able to show that an N-sorter which uses the g-way divide-sort-merge strategy recursively must contain about N(log to the base 2 of N) squared comparators. (Author).
Author | : Hosam M. Mahmoud |
Publisher | : John Wiley & Sons |
Total Pages | : 414 |
Release | : 2011-10-14 |
Genre | : Mathematics |
ISBN | : 111803113X |
A cutting-edge look at the emerging distributional theory of sorting Research on distributions associated with sorting algorithms has grown dramatically over the last few decades, spawning many exact and limiting distributions of complexity measures for many sorting algorithms. Yet much of this information has been scattered in disparate and highly specialized sources throughout the literature. In Sorting: A Distribution Theory, leading authority Hosam Mahmoud compiles, consolidates, and clarifies the large volume of available research, providing a much-needed, comprehensive treatment of the entire emerging distributional theory of sorting. Mahmoud carefully constructs a logical framework for the analysis of all standard sorting algorithms, focusing on the development of the probability distributions associated with the algorithms, as well as other issues in probability theory such as measures of concentration and rates of convergence. With an emphasis on narrative rather than technical explanations, this exceptionally well-written book makes new results easily accessible to a broad spectrum of readers, including computer professionals, scientists, mathematicians, and engineers. Sorting: A Distribution Theory: * Contains introductory material on complete and partial sorting * Explains insertion sort, quick sort, and merge sort, among other methods * Offers verbal descriptions of the mechanics of the algorithms as well as the necessary code * Illustrates the distribution theory of sorting using a broad array of both classical and modern techniques * Features a variety of end-of-chapter exercises
Author | : Bozzano G Luisa |
Publisher | : Elsevier |
Total Pages | : 1011 |
Release | : 2014-06-28 |
Genre | : Mathematics |
ISBN | : 0080933912 |
This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.
Author | : Harold Lorin |
Publisher | : Addison Wesley Publishing Company |
Total Pages | : 488 |
Release | : 1975 |
Genre | : Computers |
ISBN | : |
Prepares the programmer to create sort programs and provides the basic for reading more formidable literature in the field.