1  Algorithm NSort(A, n)
2  // Sort n positive integers
3  {
4     for i := 1 to n do B[i] := 0; // Initialize B[]
5     for i:= 1 to n do
6     {
7        j := Choice(1, n);
8        if B[j] != 0 then Failure( );
9        B[j] := A[i];
10    }
11    for i:= 1 to n-1 do // Verify order
12       if B[i] > B[i+1] then Failure( );
13    write (B[1 : n]);
14    Success( );
15 }