this is for holding javascript data
Bhathiya edited section_Challenegs_in_Bushy_Trees__.tex
about 8 years ago
Commit id: 9dec62f70a2b73af11012958f567eadb4242e323
deletions | additions
diff --git a/section_Challenegs_in_Bushy_Trees__.tex b/section_Challenegs_in_Bushy_Trees__.tex
index 00bf601..267f978 100644
--- a/section_Challenegs_in_Bushy_Trees__.tex
+++ b/section_Challenegs_in_Bushy_Trees__.tex
...
$$S(N) = \begin{cases}
1 & \text{if $N = 1$}; \\
\sum_{i=1}^{N} & \text{if $N \ne
0$};\end{cases} 0$};.\end{cases} $$
\\
Therefore the number of possible permutations are $S(N)*N!$. Unlike left-deep tree case, estimating the cost for all the possible bushy trees is computationally infeasible for moderately large N. Therefore it is required to come with a heuristic to select set of permutations for cost computations.Some heuristics considered are