You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I would like to do some runtime analysis to verify that the implementations are reasonably correct.
A cool addition to this would be a visualizer - something that graphs some sort of test suite. If I showed some curves between O(log n) -> O(2^n) it might give a fair approximation of the runtime.
The code for this is already written somewhere on my box it just needs to be plugged into a test suite of some sort. A pie in the sky TODO, iff I find that this is growing.
The text was updated successfully, but these errors were encountered:
I would like to do some runtime analysis to verify that the implementations are reasonably correct.
A cool addition to this would be a visualizer - something that graphs some sort of test suite. If I showed some curves between O(log n) -> O(2^n) it might give a fair approximation of the runtime.
The code for this is already written somewhere on my box it just needs to be plugged into a test suite of some sort. A pie in the sky TODO, iff I find that this is growing.
The text was updated successfully, but these errors were encountered: