However, really the 5+27 --> 27+5 swappage is done via a 5-hop rotation, which is got by a 5-hop left shift, a 27-hop right shift, and an OR. The word "and" here can be replaced by "and a table lookup, then". As a result, the whole algorithm is really
i. 27-reverse in 3 steps. ii. 5+27 --> 27+5 swappage while inserting a 5->5 table lookup. This a 4 steps plus a table lookup, which is kind of "4 and a half steps."
--Also, as another slimy alternative, the 5-bit reversal can be done via multiply by 100001000010000100001 binary, then mask, then another multiply by a constant, which results in the 5 bits magically moving from least-signif to most-signif end of the 32-bit word in reversed order. (No table lookup or shift needed.) The thing is, the 5 and the 27 will be being dealt with in parallel on a lot of processors, so that effectively the routine will take fewer steps.