SS$($A$[0..$ n $1])$ : if n $=2$ and A$[0]>$ A$[1]$ swap A$[0]$ $ A$[1]$ else if n $>2$ m $=$ d$2$n$/3$e SS$($A$[0..$ m $1])$ SS$($A$[$n m $..$ n $1])$ SS$($A$[0..$ m $1])$

draw the recursion tree for the above stooge sort and write the asymtotoc notation