User blog comment:MilkyWay90/Generalized Factorial Function/@comment-35392788-20180517135333/@comment-31966679-20180523212725

"P.S : it's pentation, not penetration, unless you're referring to that comic strip.​​​​​​" Edited my reply. Also, which comic strip?

F(a, b, c, ..., !, ... d, e, f, !) =

Start at the right most ! and go from right to left.

if factorial_position > 1 then{

numleft = number left of !

if numleft > 1 then{

replace ! with F(a, b, c, ..., !, ..., d, e, f - 1, !)

}

if numleft = 1 then{

delete !

replace numright with 2 (because some functions may return 1 if there is any 1 in the parameters)

}

if numleft = ! then{

repeat program again with instead examining and changing numleft instead of this !

examine and change this ! again

}

}

else{

numright = number right of !

if numright > 1 then{

replace ! with F(a, b, c, ..., !, ..., d, e, f - 1, !)

}

if numright = 1 then{

delete !

replace numright with 2 (because some functions may return 1 if there is any 1 in the parameters)

}

if numright = ! then{

repeat program again with instead examining and changing numright instead of this !

examine and change this ! again

}

}

Can you put this notation into some functions and tell me the growth rate for them?