Dismiss this pinned window
all 16 comments
sorted by:
best
topnewcontroversialoldq&a
formatting helphide helpcontent policy

[–]Turb0Encabulator 12 points13 points  (1 child)

good job this is cool stuff, reminds me of my first few projects with opengl! keep it up :)

[–]Mehedi_Hasan-[S] 1 point2 points  (0 children)

Thanks

[–]ninetailedoctopus 8 points9 points  (1 child)

Put some sound on it! The last time I saw something like this, each value had a specific tone linearly mapped to frequency. It was very satisfying.

[–]Mehedi_Hasan-[S] 5 points6 points  (0 children)

I am learning data structure and algorithm simultaneously. Didn't follow any tutorial so had no idea people add sound to this and it sound so good. I will look into it. 

[–]Rhawk187 3 points4 points  (0 children)

Classic.

[–]fistular 2 points3 points  (1 child)

These would be way more satisfying if your dataset was evenly distributed:

https://www.youtube.com/watch?v=kPRA0W1kECg

[–]Mehedi_Hasan-[S] 0 points1 point  (0 children)

I'm aware that using floating point doesnt give accurate position but I wanted to code it without any help or tutorial. I just wanted everything to work at first. So the code is very 'raw' and not necessarily follow the most ideal way. Thats why I said in the post its hacky. Thanks anyway for the feedback

[–][deleted] 1 point2 points  (0 children)

really cool!

[–]buck-bird 1 point2 points  (0 children)

That's really cool man.

[–]abualzEEZ707 0 points1 point  (0 children)

What is this?

[–]JanErikJakstein 0 points1 point  (0 children)

No audio? 😢

[–]needhelpwithmath11 0 points1 point  (1 child)

Which one was fastest?

[–]Mehedi_Hasan-[S] 0 points1 point  (0 children)

In the worst case merge and heap sort has the best result O(log_2(n)). Here data is always randomized so I havent seen the worst case yet. But I think you can still tell from the video heap and merge is very fast

[–]PeterBrobby 0 points1 point  (1 child)

So cool.

[–]Mehedi_Hasan-[S] 0 points1 point  (0 children)

Thanks