Anji-2005/sorting_analysis — reverse-engineered prompt

Build me a small sorting analysis project that compares a few common sorting algorithms and shows which ones perform better as the input gets larger. I want it to generate test data, run timing experiments, save the raw and cleaned results, and make a few clear charts I can look at without digging through code. Please include a notebook for exploring the results and a normal script version so I can rerun everything easily.

Also put together a short report that explains what was tested, how the measurements were collected, what the charts mean, and any simple takeaways about speed and scaling. Keep it practical and readable, like something I could submit for a class or share with someone who is not very technical. If there are edge cases or fairness issues in the comparison, mention those too. Look up current docs online if you need to, but keep the whole project straightforward and easy to rerun.