HN Reader

168

Author of the project here. Thank you for your warm words, and a bunch of feedback. I created the project mainly to learn about Svelte and play with algorithms, these running bars fascinate me. I was hoping that this tool would also help understand how sorting algorithms work. I still have a few features planned, such as advanced statistics.

If you have any ideas on how to develop this or want to contribute with me, I would be happy to invite you

I would also like to thank you for the stars on Github, it is really satisfying when someone enjoys the fruit of my work.

1 year agoby mszula

Oooh, bogosort led me to https://en.wikipedia.org/wiki/Bogosort and divine sort:

Divine sort A sorting algorithm that takes a list and decides that because there is such a low probability that the list randomly occurred in its current permutation (a probability of 1/n!, where n is the number of elements), there must have been a reason for the list's order. Therefore, it should be considered sorted in a way we don't understand, and we do not have any right to sort it to our beliefs, as if it were sorted "as God intended." Also known as Intelligent Design sort.[11]

1 year agoby johnchristopher

I also made a sorting visualizer based on a popular imgur sorting gifs gallery.

Demo https://xosh.org/VisualizingSorts/sorting.html

Post https://xosh.org/sorting-algorithms-visual-comparison/

Imgur gallery I was trying to replicate https://imgur.com/a/voutF

This also let you try out your own sorting algorithm too btw and share that in url. For example this algo https://xosh.org/VisualizingSorts/sorting.html#IYZwngdgxgBAZ... which was discussed at the time https://news.ycombinator.com/item?id=31975507

(Dont turn on sound, i dont know how to make it sound nicer)

The detail slider is a manual thing. You put the render call with 1/2/3 level in the loop. Only the lines with same render level will be displayed. Can be used to see the sorting at different granularity.

1 year agoby smusamashah

Ok spent way too much time fiddling with the options and testing out different sort algorithms. It’s fun to start with one sort and then halfway through switch to one that is very different and see if it helps or hurts the performance. Almost makes me want to break out the old Algorithms and Data structures book to remind myself of which one to use when you know the data could already be half sorted vs when you know the data is going to be completely random.

Bookmarked but guessing I will never use it again but who knows if I ever need to do another leet code test this would be a good resource for sorting. This could be useful for those of you that are still in college to have one of those aha moments when it comes to the sorting algorithms you are learning about. If you are going to look at the code, go to src -> lib -> sort-algorithms to see how they are implemented. Note the asterisk after the function* keyword which signifies a generator function.

1 year agoby Sn0wCoder

Siren sound: sort the table using any algorithm and then run the bubble sort on the sorted set. Press "reverse" for a different flavor.

Latch: switch to a different tab mid-sort. Switch back to stop the latch.

Metronome: Hit "valley" and run selection sort.

Free Jazz[1]: Hit "shuffle" and run bitonic sort.

[1]: https://www.youtube.com/watch?v=8bRTFr0ytA8

1 year agoby thih9

Cool project. Suggestion: disable sound by default and consider more musically pleasant tones.

1 year agoby block_dagger

I loved when it had a popup to beg me to star it on GitHub.

1 year agoby Y_Y

1 year agoby jakegmaths