#Jan. 24, 2019 C1.txt getting started
Help:=proc(): print(` OurMin(L); SelS(L);  `): end:

#OurMin(L):inputs a list of numbers and outputs the smallest entry and location
OurMin:=proc(L) local i ,n, rec,champ:
n:=nops(L):
rec:=L[1]:
champ:=1:

for i from 2 to n do
 if L[i]<rec then
   rec:=L[i]:
   champ:=i:
 fi:
od:

RETURN(rec,champ):
end:

SelS:=proc(L) local L1,NewL,i,n,mi,champ:
 n:=nops(L):
 NewL:=[]:
 L1:=L:

 for i from 1 to n do
 mi:=OurMin(L1)[1]:
 champ:=OurMin(L1)[2]:
 NewL:=[op(NewL),mi]:
 L1:=[op(1..champ-1,L1), op(champ+1..nops(L1),L1)]:
 
 od:
NewL:

end: