array reverse algorithm in js

var arr = [34, 234, 567, 4];
print(arr);
var new_arr = arr.reverse();
print(new_arr);

const list = [1, 2, 3, 4, 5];
list.reverse();

let array1 = ["yes", "no", "maybe", "always", "sometimes", "never", "if"];
let array2 = [5,8,2,9,5,6,3,1];

function reverseArray(arr) {
  var newArray = [];
  for (var i = arr.length - 1; i >= 0; i--) {
    newArray.push(arr[i]);
  }
  return newArray;
}

reverseArray(array1); // ["if", "never", "sometimes", "always", "maybe", "no", "yes"]
reverseArray(array2); // [1, 3, 6, 5, 9, 2, 8, 5]

var rev = arr.reverse();  

// reverse array with recursion function
function reverseArray (arr){
if (arr.length === 0){
return []
}
  return [arr.pop()].concat(reverseArray(arr))
}
console.log(reverseArray([1, 2, 3, 4, 5]))

const reversed = array1.reverseconst reversed = array1.reverse();
console.log('reversed:', reversed);
// expected output: "reversed:" Array ["three", "two", "one"]();
console.log('reversed:', reversed);
// expected output: "reversed:" Array ["three", "two", "one"]const reversed = array1.reverse();
console.log('reversed:', reversed);
// expected output: "reversed:" Array ["three", "two", "one"]

const reverseArray = arr => arr.reduce((acc, val) =>  [val, ...acc], [])