[Kerieel]

Hi, I was wondering if anyone had a few seconds to helping me to figure out how to graph time complexity of merge sort and insertion sort for my class. I'm really new at Python and but I figured doing this in Python would be a lot easier than implementing it in C++, which would be pretty difficult. Are there existing libraries that I could use? Thanks.

Full prompt if anyone needs more specific details:
https: //pastebin.com/GfyZDaBZ

[enmafia2]

There are some people who tried doing this, but it's kinda hard to implement as you have to run the code and halting is a problem.
Here you have something that might help you:
https://github.com/pberkes/big_O

I'd rather do it manually.