%%off % Optimized Straight Selection Sort % 5.2.1 Page 81 % Martin Ruckert, 26.3.2012 R IS $0 %%def $R$ n IS $1 %%def $n$ j IS $2 %%def $j$ i IS $3 %%def $i$ k IS $4 %%def $K$ ki IS $5 %%def $K_i$ R1 IS $6 %%def $R_{-1}$ tmp IS $7 %%on %\r0=R, \r1=n\hidewidth &&&Parameter. %%\mmsskip %\r2=j, \r3=i, \r4=k, \hidewidth &&& Local variables. %\r5={k_j}, \r6={R_{-1}} %%\mmsskip Isort SL j,n,3 \hfil$1$& \ul{\sl S1.~Loop on $j$.} SUBU R1,R,8 \hfil$1$& Address of $R_{-1}$ SUB j,j,16 \hfil$1$& JMP 0F \hfil$1$& %%% 2H ADD i,j,8 \hfil$N-1$& \ul{\sl S2.~Set up $j$, $K$, $R$.} LDO k,R,j \hfil$N-1$& JMP 3F \hfil$N-1$& %%% 4H STO ki,R1,i \hfil$B$&\ul{\sl S4.~Move $R_i$, increase $i$.} ADD i,i,8 \hfil$B$& 3H LDO ki,R,i \hfil$B+N-1$& \ul{\sl S3.~Compare $K : K_i$.} CMP tmp,k,ki \hfil$B+N-1$& PBP tmp,4B \hfil$B+3(N-1)$& STO k,R1,i \hfil$N-1$& \ul{\sl S5.~$R$ into $R_{i+1}$.} %%% SUB j,j,8 \hfil$N-1$& 0H PBNN j,2B \hfil$N+2$& %%% POP 0,0