The sorting problem: Given a sequence A1, A2 ,..., An of integers, find the sorted sequence B1, B2 ,..., Bn consisting of the same set of integers ordered so that:
B1 < B2 < ... < Bn
Stage 2: Repeat stage 1, reducing the length of the list by one element each time through, until the length of the new list is exactly 1.
** Identify the elements of problem solving in this algorithm
CS1104 Main Page
Last Updated 2002/02/01
© L.Heath, 2000, upgraded by J.A.N. Lee on above date.