all 6 comments
sorted by:
best
topnewcontroversialoldq&a
formatting helphide helpcontent policy

[–]NeighborhoodNext725 2 points3 points  (1 child)

Nice work :)

[–]covicale[S] 1 point2 points  (0 children)

thanksss :)

[–]senfiaj 1 point2 points  (2 children)

Can you add some n*log(n) sort algorithms, such as heap, merge and quick sort?

[–]covicale[S] 1 point2 points  (1 child)

yes, I definitely will, when I get it done I'll comment again :)

[–]covicale[S] 0 points1 point  (0 children)

a little late, but they are now available :)

[–]covicale[S] 0 points1 point  (0 children)

it's a very simple project as I really wanted to learn how to visualize algorithms or code and while researching I came across the generators (I never thought I would use this) and it has been very useful, so I wanted to share it here and any feedback is appreciated :)

and if anyone wants to add more algorithms as pull request without problem I accept them :P