Develop a Python application using PyCharm that compares the performance of Merge Sort and Heap Sort algorithms on a large dataset. The application should do the following: Implement both sorting algorithms Visualize the sorting process using graphical representations, such as charts or animations Analyze the performance of each algorithm, providing detailed comparisons of their efficiency in terms of time complexity and memory usage Data Visualization Requirements: Include clear and informative visualizations of the sorting process. Provide screenshots of the output during the sorting process, demonstrating how the data is organized at different stages. Use bar graphs and line charts to compare the time taken by each algorithm across varying dataset sizes.
Please do not us AI to answer