skip to Main Content

What Different Sorting Algorithms Sound And Look Like

Via

Dieser Beitrag hat 216 Kommentare
  1. @kefan06 In a nutshell..
    Insertion sort : Insert elements into sorted chunk
    Bubble sort : Swap if reversed. repeat until done.
    Selection sort : Select smallest.
    Merge sort : Divide array, sort left, sort right, and merge.
    Gnome sort : I don’t know but probably insertion+bubble sort
    Heapsort : Make a heap (which makes choosing biggest one ‚fast‘) and pop the biggest element until the heap is empty.
    Also, quicksort : choose middle, smaller elements go left, larger element go right, sort left&right

  2. @kefan06 In a nutshell..
    Insertion sort : Insert elements into sorted chunk
    Bubble sort : Swap if reversed. repeat until done.
    Selection sort : Select smallest.
    Merge sort : Divide array, sort left, sort right, and merge.
    Gnome sort : I don’t know but probably insertion+bubble sort
    Heapsort : Make a heap (which makes choosing biggest one ‚fast‘) and pop the biggest element until the heap is empty.
    Also, quicksort : choose middle, smaller elements go left, larger element go right, sort left&right

  3. @kefan06 In a nutshell..
    Insertion sort : Insert elements into sorted chunk
    Bubble sort : Swap if reversed. repeat until done.
    Selection sort : Select smallest.
    Merge sort : Divide array, sort left, sort right, and merge.
    Gnome sort : I don’t know but probably insertion+bubble sort
    Heapsort : Make a heap (which makes choosing biggest one ‚fast‘) and pop the biggest element until the heap is empty.
    Also, quicksort : choose middle, smaller elements go left, larger element go right, sort left&right

  4. @kefan06 In a nutshell..
    Insertion sort : Insert elements into sorted chunk
    Bubble sort : Swap if reversed. repeat until done.
    Selection sort : Select smallest.
    Merge sort : Divide array, sort left, sort right, and merge.
    Gnome sort : I don’t know but probably insertion+bubble sort
    Heapsort : Make a heap (which makes choosing biggest one ‚fast‘) and pop the biggest element until the heap is empty.
    Also, quicksort : choose middle, smaller elements go left, larger element go right, sort left&right

  5. @kefan06 In a nutshell..
    Insertion sort : Insert elements into sorted chunk
    Bubble sort : Swap if reversed. repeat until done.
    Selection sort : Select smallest.
    Merge sort : Divide array, sort left, sort right, and merge.
    Gnome sort : I don’t know but probably insertion+bubble sort
    Heapsort : Make a heap (which makes choosing biggest one ‚fast‘) and pop the biggest element until the heap is empty.
    Also, quicksort : choose middle, smaller elements go left, larger element go right, sort left&right

  6. @kefan06 In a nutshell..
    Insertion sort : Insert elements into sorted chunk
    Bubble sort : Swap if reversed. repeat until done.
    Selection sort : Select smallest.
    Merge sort : Divide array, sort left, sort right, and merge.
    Gnome sort : I don’t know but probably insertion+bubble sort
    Heapsort : Make a heap (which makes choosing biggest one ‚fast‘) and pop the biggest element until the heap is empty.
    Also, quicksort : choose middle, smaller elements go left, larger element go right, sort left&right

  7. @kefan06 In a nutshell..
    Insertion sort : Insert elements into sorted chunk
    Bubble sort : Swap if reversed. repeat until done.
    Selection sort : Select smallest.
    Merge sort : Divide array, sort left, sort right, and merge.
    Gnome sort : I don’t know but probably insertion+bubble sort
    Heapsort : Make a heap (which makes choosing biggest one ‚fast‘) and pop the biggest element until the heap is empty.
    Also, quicksort : choose middle, smaller elements go left, larger element go right, sort left&right

  8. @kefan06 In a nutshell..
    Insertion sort : Insert elements into sorted chunk
    Bubble sort : Swap if reversed. repeat until done.
    Selection sort : Select smallest.
    Merge sort : Divide array, sort left, sort right, and merge.
    Gnome sort : I don’t know but probably insertion+bubble sort
    Heapsort : Make a heap (which makes choosing biggest one ‚fast‘) and pop the biggest element until the heap is empty.
    Also, quicksort : choose middle, smaller elements go left, larger element go right, sort left&right

  9. @kefan06 In a nutshell..
    Insertion sort : Insert elements into sorted chunk
    Bubble sort : Swap if reversed. repeat until done.
    Selection sort : Select smallest.
    Merge sort : Divide array, sort left, sort right, and merge.
    Gnome sort : I don’t know but probably insertion+bubble sort
    Heapsort : Make a heap (which makes choosing biggest one ‚fast‘) and pop the biggest element until the heap is empty.
    Also, quicksort : choose middle, smaller elements go left, larger element go right, sort left&right

  10. So this isn’t exactly the sound of sorting algorithms, just the sounds of the data sets you’re sorting. the sound is just in a different order since the method of sorting is different.

  11. So this isn’t exactly the sound of sorting algorithms, just the sounds of the data sets you’re sorting. the sound is just in a different order since the method of sorting is different.

  12. So this isn’t exactly the sound of sorting algorithms, just the sounds of the data sets you’re sorting. the sound is just in a different order since the method of sorting is different.

  13. So this isn’t exactly the sound of sorting algorithms, just the sounds of the data sets you’re sorting. the sound is just in a different order since the method of sorting is different.

  14. So this isn’t exactly the sound of sorting algorithms, just the sounds of the data sets you’re sorting. the sound is just in a different order since the method of sorting is different.

  15. So this isn’t exactly the sound of sorting algorithms, just the sounds of the data sets you’re sorting. the sound is just in a different order since the method of sorting is different.

  16. So this isn’t exactly the sound of sorting algorithms, just the sounds of the data sets you’re sorting. the sound is just in a different order since the method of sorting is different.

  17. So this isn’t exactly the sound of sorting algorithms, just the sounds of the data sets you’re sorting. the sound is just in a different order since the method of sorting is different.

  18. So this isn’t exactly the sound of sorting algorithms, just the sounds of the data sets you’re sorting. the sound is just in a different order since the method of sorting is different.

  19. So this isn’t exactly the sound of sorting algorithms, just the sounds of the data sets you’re sorting. the sound is just in a different order since the method of sorting is different.

  20. So this isn’t exactly the sound of sorting algorithms, just the sounds of the data sets you’re sorting. the sound is just in a different order since the method of sorting is different.

  21. So this isn’t exactly the sound of sorting algorithms, just the sounds of the data sets you’re sorting. the sound is just in a different order since the method of sorting is different.

  22. So this isn’t exactly the sound of sorting algorithms, just the sounds of the data sets you’re sorting. the sound is just in a different order since the method of sorting is different.

  23. That’s not a mistake, its an optimisation. And actually it creates a larger overhead on a best case scenario sort, but it is better for a worst or average case sort.

  24. Nice video! I was watching this video on my cell phone before and I couldn’t see which algorithms were you using each time because the screen is so small that letters on top are unreadable, but I could clearly recognize bubble sort because it was the longest and the slowest one 😀

  25. Bubble’s wrong. You can reduce the ending search index so it decrements the end by one because it knows the rest is already done.

  26. „Gnome sort“ is actually an American variant of „Leprechaun sort“, an Irish tradition which involves leaving the items out on ones lawn so that the wee people could put them in correct order. To be sure, to be sure….

  27. This is great. I play with modular synths a lot and a cool little iPhone app called GLITCHMACHINE whose whole purpose is to make sound from code. You should check it out! 🙂

Kommentare sind geschlossen.

Back To Top