1.3.1 Sorting

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A set of n items.

Problem: Arrange the items in increasing order.

Implementations

  • Handbook of Algorithms and Data Structures (Pascal) (rating 7)
  • Moret and Shapiro's Algorithms P to NP (Pascal) (rating 7)
  • Xtango and Polka Algorithm Animation Systems (C++) (rating 6)
  • Algorithms in C++ -- Sedgewick (C++) (rating 5)
  • Netlib / TOMS -- Collected Algorithms of the ACM (FORTRAN) (rating 4)
  • Nijenhuis and Wilf: Combinatorial Algorithms (FORTRAN) (rating 3)
  • Combinatorica (Mathematica) (rating 2)

    Related Problems

  • Convex Hull
  • Dictionaries
  • Median and Selection
  • Priority Queues
  • Searching
  • Topological Sorting

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .