Not magic.  It provably works.
	• Keys – N-digit numbers – base B • Claim: after ith BinSort, least significant i digits are sorted. – e.g. B=10, i=3, keys are 1776 and 8234.  8234 comes before 1776 for last 3 digits.