We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Linux Shell
  3. Bash
  4. Functions and Fractals - Recursive Trees - Bash!
  5. Discussions

Functions and Fractals - Recursive Trees - Bash!

  • dhruvflare
     + 0 comments

    as a bash noob, this was tough, but some brute-force algos always work lol

    declare -A mat
rows=63
cols=100
read n
f=16
for ((i=0; i<$rows; ++i)) do
    for ((j=0; j<$cols; ++j)) do
        mat[$i,$j]="_"
    done
done

pow(){
    local v=1
    for((i=1; i<$1; ++i)) do
        v=$(($v*2))
    done
    echo $v
}

it() { # mid, iteration, row
    local nums=$(($f/$(pow $2)))
    local a=$3
    local b=$(($3+$nums))

    for((i=$a; i<$b; ++i)) do
        mat[$i,$1]=1
    done

    local ml=$1
    local mr=$1

    a=$b
    b=$(($b+$nums))
    for((i=$a; i<$b; ++i)) do
        ml=$(($ml-1))
        mat[$i,$ml]=1
    done    

    for((i=$a; i<$b; ++i)) do
        mr=$(($mr+1))
        mat[$i,$mr]=1
    done
    local x=$(($2+1))
    if (( $x <= $n )) then
        it $ml $x $b;
        it $mr $x $b;
    fi
};

it 49 1 0;

for ((i=$(($rows-1)); i>=0; --i)) do
    for ((j=0; j<$cols; ++j)) do
        echo -n ${mat[$i,$j]}
    done
    echo
done