RADIX sort is stable, as the chosen underlying digit sorting algorithm is stable. [1]}. If the input integers have at most \(d\) -digits, then the algorithm will go through the array \(d\)  times, once for each digit. The pseudo-code for RADIX sort is shown in Algorithm REF .
<FIGURE>