Question

True/False

5. For very large integer multiplication Karatsuba is faster than FFT based multiplication. 6. A shortest path tree of a graph is a subgraph that is connected and acyclic. 7. Max-heap insert runs in O(n log n) time. 8. Binary search of a list assumes that the list is in ascending ordered.

Answer 1

I 5. For very large integer multiplication Karatsuba is faster than FFT based multplication. I 6. A shortest path tree of a graph is a subgraph that is connected and acyclic. 7. Max-heap insert runs in O(n log n) time. I 8. Binary search of a list assumes that the list is in ascending ordered.