Sort by time | Sort by thread (beta)
Link to this comment:
Share to:
Loading...
Loading...Saving...
Nice, although the animation is rather flickery O.o
Scrumplesplunge 9 months ago
Selection sort is really inefficient. Quicksort is sort of a more intelligent version of this algorithm, but my favorite is merge. Fast and very stable.
notToast 2 years ago
can i hav the source code 4 this video?
raonitte1 2 years ago
Hi brunocafeo, it is a good idea to visualize sorting algorithm with OpenGL. Can I have the source code of your OpenGL sorting algorithm sorting?
zakiakhmad 2 years ago
Indonesian Copy+Paste attack GO!
benutzer2 2 years ago
Haha... I am just curious how to visualize it :D
zakiakhmad 2 years ago
OH!!! OK!!! lol then by all means go and get the source code? Maybe there are some tutorials out there. Try those. Wish you the best of luck.
benutzer2 2 years ago
LOL
zakiakhmad 2 years ago
bubble 4 ever )
selection is to slow
spider853 4 years ago
bubble is also slow. try quicksort.
acidwillburnyou 3 years ago 4
Might want to use a stable algorithm, like merge or bucketsort...
magicdutta 2 years ago
cool , doyou have another algoritms ??
bubble, quick, merge,, great work man
OP3NGL 4 years ago 2
More videos with another algoritms!
brunocafeo 3 years ago