this is for holding javascript data
Bhathiya edited section_Challenegs_in_Bushy_Trees__.tex
about 8 years ago
Commit id: 25df0b1b2becb412377dbdfa1388b7fe10216279
deletions | additions
diff --git a/section_Challenegs_in_Bushy_Trees__.tex b/section_Challenegs_in_Bushy_Trees__.tex
index 3aed2fb..c1d9bea 100644
--- a/section_Challenegs_in_Bushy_Trees__.tex
+++ b/section_Challenegs_in_Bushy_Trees__.tex
...
$$S(N) = \begin{cases}
1 \text{if $ N = 1$}; \\
$\displaystyle \sum_{i=1}^{N} \frac{1}{n}$ \text{if $N \ne 0$};
2 \text{if $ N =
1$};.\end{cases}$$ 1$}.\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