We can trace the execution of a comparison-based algorithm by using a graph called a ____.
A) pivot table
B) partition table
C) comparison tree
D) merge tree

Question

Quizplus · Accepted Answer

The graph that is used to trace the execution of a comparison-based algorithm is called a comparison tree. It represents the different comparisons made during the execution of the algorithm and helps in understanding its time complexity. The other options, such as pivot table, partition table, and merge tree, are not relevant for tracing the execution of a comparison-based algorithm.

We Can Trace the Execution of a Comparison-Based Algorithm by Using