Problem 68. Kaprekar Steps

I am used to program with C, could someone have a vectorization solution for this problem in MATLAB way?

function y = KaprekarSteps(x)
y = 0;
while ~(x == 6174 || x == 0)
x = step(x);
y = y + 1;
end
if x == 0
y = inf;
end
end

function x = step(x)
digits = getDigits(x);
gain = [1000 100 10 1]';
x_d = sort(digits,"descend")*gain;
x_a = sort(digits,"ascend")*gain;
x = x_d - x_a;
end

function digits = getDigits(x)
digits = [0 0 0 0];
for i = 1:4
digits(i) = fix(x/(10^(4-i)));
x = mod(x,10^(4-i));
end
end

The test suite doesn't match the problem description - how can the answer to test two be 5?

Cheated with 1...:
1000 - 0001 = 999.
999 - 999 = 0
y = inf;

No?

How it works with x = 3, x = 691, x = 1?

This works for all but test 3 where it gives, in my opinion, the correct answer 8.

But zero is not sorted in this solution. You should get same answer for input x = 691 and 6910. (And then no need for abs())

1) 9610-0169=9441
2) 9441-1449=7992
3) 9972-2799=7173
4) 7731-1377=6354
5) 6543-3456=3087
6) 8730-0378=8352
7) 8532-2358=6174

This has been the lamest test so far. You need to pad the numbers with zeros to build it up to be a 4 digit number. Not explained in the rules.

Not all test cases seem to be correct. For example x=3 would imply that the next value should be x=3-3=0, so y_correct=Inf and not 6

An efficient lookup table solution

Interesting - a recursive approach

Could you stop doing this kind of thing? I think it would be a lot more fun if we could see the _actual_ best solution..