Question

true or false: a bottom - up mergesort increases the time and space overhead of typical mergesorts because it does not use a stack to handle recursive calls. true false

Explanation:

Bottom - up mergesort is an iterative implementation of the mergesort algorithm. It does not use recursive calls (and thus does not have the overhead associated with function call stack management). Typical recursive mergesort has function call overhead due to recursive calls. Since bottom - up mergesort avoids recursive calls (not just stack usage in a narrow sense of stack data structure for call management), the statement in the question is False.

Answer:

False