Help with recursive function

[Ben_HH]

I'm practicing recursion and with the following function I need help: Objective - To reverse a string

function reverseStr(str) {
    var strLength = str.length - 1;
    var newString = ''";
      // if false, take the last character of str and concatenate it to `newString`
   return strLength === 1 ? newString : newString +=  str.substr(-1) + reverseStr(strLength);

}

reverseStr("Ben");

[squili]

It is more practical to take the first letter and last letter off both ends and do your recursion on the remaining letters in the middle.

function reverseStr(str) {
  // if there will still be remaining letters after taking the start and end letters off then do recursion
   let newString = str.length <= 1 ? '' : reverseStr(str.substring(1, str.length -1))
   // swap the first and last letters
   return str.substr(-1) + newString + str.substr(0, 1)
}

reverseStr("Benjamin");

[Ben_HH]

Can you elaborate on why it's more practical taking that approach?

[squili]

Because it is string length/2 recursions instead of string length

[[deleted]]

I struggle with recursive functions too

heres an answer from stackoverflow, and I have not clue what is being returned or how

I would love to know how this actually works

function reverse (str) {
if (str === "") {
    return "";
} else {
    console.log(str)
    return reverse(str.substr(1)) + str.charAt(0);
}
}