Is this technically recursion?

See more:

Javascript

Test Cases:

addToTwelve([1, 3, 4, 7, 5]); // true
addToTwelve([1, 3, 4, 7, 6]); // false
addToTwelve([1, 11, 4, 7, 6]); // true
addToTwelve([1, 12, 4, 7, 6]); // false
addToTwelve([1]); // false

I feel like this is more of a callback than recursion since I am iteratively going through the array and then recalling the function. But, I'm recalling the function on itself until a basecase is met,yet I'm using a for loop which is iterative..

I think, recursively, what I need to do is return the array and shift first element and then recheck if the first + second = 12 and if true return true. Base case being array.length < 1.

What I have tried:

function addToTwelve(array) {
  
  if (array.length < 1) {
    return false;
  } else {
    for (let i = 0; i < array.length; i++) {
      if (array[i] + array[i+1] === 12) {
        return true;
      } else {
        array.shift()
        console.log(array)
        return addToTwelve(array);
      }
    } 
  }
}

I refactored it without the for loop but recursion is really busting my brain here.

function addToTwelve(array) {
  
  if (array.length < 1) {
    return false;
  } else if (array[0]+array[1] === 12) {
    return true;
  } else {
    array.shift();
    return addToTwelve(array)
  
  }
};

Is that considered recursion now? XD Can you show me perhaps a better way to complete this?