Pseudo Code
Algoritma MiniMax_Sort;
Deklarasi
integer i,j,n,imax,temp,x,max,Data[100];
Deskripsi
write('Jumlah Data : ');
read(n);
if (n < 0) or (n > 100) then
n 5;
endif.
for i 1 to n do
write('Angka ke-',i,' : ');
readln(Data[i]);
endfor.
write('Data Awal : ');
for i 1 to n do
write(Data[i],' ');
endfor.
imax n;
{lakukan putaran(i) sebanyak n-1 kali}
for 1 to n - 1 do
{cari nilai terbesar diantara Data[1] hingga Data[n-i]}
max -999;
for j1 to n - i do
if Data[j] > max then
x := j;
max := Data[j];
endif.
endfor.
if Data[x] > Data[imax] then
temp := Data[imax];
Data[imax] := Data[x];
Data[x] := temp;
endif;
{ambil elemen berikutnya}
imax imax - 1;
endfor.