Is this Fib recursion?

#include <iostream>
using namespace std;

int n;
void fib(int y, int x, int cnt)
{
    if(cnt == n)
        return;
    cout << x << " ";
    cnt++;
    int t = x;
    x = y;
    y = t + y;
    fib(y, x, cnt);
    return;
}

int main() {
    cin >> n;
    fib(1, 0, 0);
    return 0;
}