Description

Book Synopsis
This work covers the emerging distributional theory of sorting. It book opens with a chapter on the general area of complete and partial sorting. The following chapters discuss every standard sorting algorithm with a careful explanation of the mechanics of the algorithm both as code and verbally.

Trade Review
"Discussion of a range of common sorting approaches...with emphasis on, and analysis of, the distributions associated with the complexity measures on the algorithms." (American Mathematical Monthly, March 2002)

"...this book, in addition to being a reference book for computer professionals, is a good book to be used in teaching..." (Mathematical Reviews, 2003a)



Table of Contents
Sorting and Associated Concepts.

Insertion Sort.

Shell Sort.

Bubble Sort.

Selection Sort.

Sorting by Counting.

Quick Sort.

Sample Sort.

Heap Sort.

Merge Sort.

Bucket Sorts.

Sorting Nonrandom Data.

Epilogue.

Answers to Exercises.

Appendix.

Bibliography.

Index.

Sorting A Distribution Theory Wiley Series in

    Product form

    £174.75

    Includes FREE delivery

    RRP £183.95 – you save £9.20 (5%)

    Order before 4pm today for delivery by Mon 17 Aug 2026.

    A Hardback by Hosam M. Mahmoud

    10 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Sorting A Distribution Theory Wiley Series in by Hosam M. Mahmoud

      Publisher: John Wiley & Sons Inc
      Publication Date: Publication Date: 05/09/2000
      ISBN13: 9780471327103, 978-0471327103
      ISBN10: 0471327107
      Also in:
      Computer science

      Description

      Book Synopsis
      This work covers the emerging distributional theory of sorting. It book opens with a chapter on the general area of complete and partial sorting. The following chapters discuss every standard sorting algorithm with a careful explanation of the mechanics of the algorithm both as code and verbally.

      Trade Review
      "Discussion of a range of common sorting approaches...with emphasis on, and analysis of, the distributions associated with the complexity measures on the algorithms." (American Mathematical Monthly, March 2002)

      "...this book, in addition to being a reference book for computer professionals, is a good book to be used in teaching..." (Mathematical Reviews, 2003a)



      Table of Contents
      Sorting and Associated Concepts.

      Insertion Sort.

      Shell Sort.

      Bubble Sort.

      Selection Sort.

      Sorting by Counting.

      Quick Sort.

      Sample Sort.

      Heap Sort.

      Merge Sort.

      Bucket Sorts.

      Sorting Nonrandom Data.

      Epilogue.

      Answers to Exercises.

      Appendix.

      Bibliography.

      Index.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account