Algorithms Questions
- Visualize Merge Sort using an example. The array could be any size as long as it is a 2^N form.
- Explain your observation of the running time using the visualization
- Generalize the running time of Merge-Sort for an array of n elements