var canMakeArithmeticProgression = function(arr) {
let quickSort = function (arr) {
if (arr.length < 2) {
return arr;
}
let left = [];
let right = [];
let mid = Math.floor((arr.length - 1) / 2);
let midValue = arr.splice(mid, 1)[0];
for (let i of arr) {
if(i < midValue) {
left.push(i);
continue;
}
right.push(i);
}
return quickSort(left).concat(midValue, quickSort(right))
}
let sortArr = quickSort(arr);
console.log(sortArr);
let diff = sortArr[1] - sortArr[0];
let i = 1;
while( i < sortArr.length - 1){
if(sortArr[i+1] !== sortArr[i] + diff){
return false;
}
i++
}
return true;
};
console.log(canMakeArithmeticProgression([4,2,3,1]));
console