Explain the code with recursion?

Question

recursion

Code given.

function myFunction(n){

        if(n==1){ return "1";}
        return myFunction(n - 1) + " " + n;

    };

    
    document.write(myFunction(10));

I understand a little about recursion, I did the factorial myself in 3 ways and Fibonacci.
But here I can not understand how the recursion works.
The code prints numbers from 1 to n , in ascending order, but I've already lost an hour and can't catch up why in ascending and not descending order.

Answer 1

Think about this (an hour may not be enough):

function myFunction(n){
        if(n==1){ return "1";}
        return n + " " + myFunction(n - 1);

    };