Without using Functions and Procs, it can be done by programming. Assuming you have an array of medium size you can use simple and fairly easy insertion sort to sort the elements in place. The duplicate items will be marked as missing values in the array. If you have larger array of size in millions, use Quicksort but you have to modify the code to catch the duplicate items. Hope this interests you.
data _null_;
array k[8] _temporary_ (2 3 5 2 7 6 7 1);
do i = 1 to dim(k) - 1;
do j = i+1 to dim(k);
if k[i] = k[j] then do; k[j] =.; continue; end;
if k[i] > k[j] then do;
t = k[i];
k[i] = k[j];
k[j] = t;
end;
end;
end;
do i = 1 to dim(k);
put k[i] =;
end;
run;
k[1]=1
k[2]=.
k[3]=2
k[4]=3
k[5]=5
k[6]=6
k[7]=.
k[8]=7
... View more