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
{{ message }}
This repository has been archived by the owner on Jan 9, 2019. It is now read-only.
However, it does so by animating snapshots at particular points. This is hard to do with running javascript because the amount of code run between visualization updates is different.
My suggestion would be do not compare algorithms by having more than one at a time, but merely selecting one. Another possibility would be to rewrite the code in your pyodide Python using generators, so that each co-routine would be in sync.
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Your comparing algorithms example is great for visualizing individual sorting algorithms, but is problematic if it is used to compare algorithms.
Here is a nice site that does compare algorithms properly: https://www.toptal.com/developers/sorting-algorithms/
However, it does so by animating snapshots at particular points. This is hard to do with running javascript because the amount of code run between visualization updates is different.
My suggestion would be do not compare algorithms by having more than one at a time, but merely selecting one. Another possibility would be to rewrite the code in your pyodide Python using generators, so that each co-routine would be in sync.
The text was updated successfully, but these errors were encountered: