Array sorting, compared to three-bit values according to the original number of digits, more than three bits to take the back three bit to compare

First step: First to determine the length of the value, first turn him into a string, in judging the number of digits, intercept the back of the three-bit to compare
var arr=[12432,34,535,89002,452,50]
for (Var i=0;i<arr.length;i++) {
Arr[i]=arr[i].tostring ()
if (arr[i].length>3) {
Arr[i]=arr[i].substr (arr[i].length-3)
}
}
The second step: convert the string into a numerical value to compare and judge
b = Arr.map (function (e) {return parseint (e);})
function Compare (value1,value2) {
if (value1 < value2) {
return-1;
}else if (value1 > value2) {
return 1;
}else{
return 0;
}
}
B.sort (Compare);

        以上是根据自己的想法来写的，不知道是否有简洁的办法来实现

Array sorting, compared to three-bit values according to the original number of digits, more than three bits to take the back three bit to compare