% \f(HDSorting:\fP can be done by iterated maximum finding
%
% As a first step, find the maximum in a list and put it at
% the head of the list.

const small := -1000000
const N: int := 100			% maximum names

var i: int  := 0
var imax: int  := 1			% index of maximum
var maximum: real := small	% start max off very small
var foo: real				% a dummy variable
var numbers : array 1 .. N of real

%
% First get the numbers.
%
	


%
% Find the maximum
%
		


%
% We have our maximum, so now put it at the head of the list.
%



%
% Output the (partially-sorted) list
%
put "The partially sorted list is now"
for j: 1..i
	put numbers(j)
end for