Question

Problem 2 Decision Trees [15 pts] Recall that a comparison-based sorting algorithm can be represented in the (binary) decision tree model. Following the worked example of Tutorial SS13, the figure below shows part of the decision tree for mergesort operating on a list of 4 numbers, $a_1$, $a_2$, $a_3$, $a_4$. Please expand subtree $T_1$, i.e., draw and label all of the edges, internal (comparison) nodes and leaves in subtree $T_1$. Edges in the tree must be labelled with $\le$ or $>$ and leaves must show the final sorted order.

          Problem 2 Decision Trees [15 pts]
Recall that a comparison-based sorting algorithm can be represented in the
(binary) decision tree model.
Following the worked example of Tutorial SS13, the figure below shows part
of the decision tree for mergesort operating on a list of 4 numbers, $a_1$, $a_2$, $a_3$,
$a_4$. Please expand subtree $T_1$, i.e., draw and label all of the edges, internal
(comparison) nodes and leaves in subtree $T_1$.
Edges in the tree must be labelled with $\le$ or $>$ and leaves must show the
final sorted order.

Problem 2 Decision Trees [15 pts]
Recall that a comparison-based sorting algorithm can be represented in the
(binary) decision tree model.
Following the worked example of Tutorial SS13, the figure below shows part
of the decision tree for mergesort operating on a list of 4 numbers, a1, a2, a3,
a4. Please expand subtree T1, i.e., draw and label all of the edges, internal
(comparison) nodes and leaves in subtree T1.
Edges in the tree must be labelled with ≤ or > and leaves must show the
final sorted order.

Added by Enrique K.

Question

Please give Ace some feedback