Cool job! Gnome Sort - now that's new to me!
What different sorting algorithms sound like
11–20 of 40 posts
Re: What different sorting algorithms sound like
#12There's a lot of effort been put in to this, I like it. I love that you can hear the bubbling in bubble sort :D
I noticed that too! Good stuff.
Re: What different sorting algorithms sound like
#13That was super cool! I really enjoyed how my brain started matching the sound and the bar heights in such a way that by the end I said "of course that one sounds like that".
Re: What different sorting algorithms sound like
#14This makes me want to sort something. The loose change strewn all over my desk. The contents of my fridge. The words on this page. Anything.
Re: What different sorting algorithms sound like
#15where is quicksort?
Re: What different sorting algorithms sound like
#16Disclaimer: sorting algorithms can sound like just about anything, depending which parameters you map to which sounds.
This is just a simple example of data sonification, albeit with some nice visualisation too, and a subject matter which appeals to the computer scientists in the room.
Re: What different sorting algorithms sound like
#17That was really cool. Is the speed indicative of the speed of the sort?
Given that the width of the elements being sorted changes (therefore there are more/less elements in different visualisations), I'd say no.
Re: What different sorting algorithms sound like
#18This makes me want to sort something. The loose change strewn all over my desk. The contents of my fridge. The words on this page. Anything.
Anything. The The The This all change contents desk. fridge. loose makes me my my of on over page. something. sort strewn this to want words
Re: What different sorting algorithms sound like
#19That was really cool. Is the speed indicative of the speed of the sort?
I would say it's likely. There are all sorts (pun intended) of optimizations you can do for each algorithm, but at the textbook level, I could say they seemed typical as far as speed expectancy goes. My rough estimates for the times were (in seconds): insert: ~10, bubble: ~27, selection: ~18, merge: ~17, and gnome: ~19. I have only written inserts, bubbles, and selections; with bubble being slowest and insert being the fastest, my limited experience agrees with the video. Note: the merge algorithm appeared to have sorted a different data set.
Re: What different sorting algorithms sound like
#20I think Mathematica can be used to make "audiolizations" really easily. They include one of the Riemman Zeta function as a demo. It sounds really cool (sorry I can't find a link, I'll try upload it)