23rd_Aug_recursion3_actual

import {heart, show, stack, stack_frac, sail} from 'rune';

// show(stackn(3,heart));

show(stack(stack(heart, heart), stack(heart,heart)));

// stack_frac(r,heart, sail)

// specifies how much the top one should take up and the bottom one takes the rest

show(stack_frac(1/3, heart,stack(heart,heart)));

show(stack_frac(1/2,stack_frac(1/2, heart, heart), stack_frac(1/2, heart, heart)));

show(stack_frac(1/4, heart, 
                stack_frac(1/3, heart,
                            stack_frac(1/2, heart, heart))));
                            
// overwriting primitive function

function stackn(n, rune){
    return n===1
    ? rune // terminating condition
    :stack_frac(1/n, rune, stackn(n-1, rune));
}

show(stackn(5,heart));

/*
solution for n using solution for n-1 -> wishful thinking
*/

// == : checks for type -> verify
// === : checks for equivalence