Over 70 Sorting Algorithms in Under an Hour - Disparity Chords 

i personally am a merge sort type of guy but wow. i think heap sort is at 2 in my list now

@@ZNC-hk1qk hell yeah

Heap sort and merge sort have virtually identical performance in terms of number of comparisons and number of writes to the array, and both are unaffected by the initial array order which can cause other n*log(n) sorts to degenerate to n^2 performance (e.g. Quick Sort). Heap sorts have an advantage in that they do not require an auxiliary array. However, merge sorts can sort an array that is too big to fit in memory by writing partially-sorted chunks to external storage (e.g. disk). Most of the optimized library sorts like std_sort use a combination of merge, heap, and quick sorts to achieve maximum performance.

old arcade music

PSI Hypnosis Ω

​@@spacesandwich5593The Sorting Algorithm couldn't stop crying!

Yup!

I knew it and first time seeing rules before commenting and i think its a nice addition unlike the dislikes being removed

Personally the way I'd explain it is by saying that the "target" (the value being sorted) is repeatedly swapped down the sorted part of the list in gnome sort, but this step is skipped in insertion sort to cut down on the number of array writes. That, and Insertion Sort keeps track of the next value that needs to be moved into place and doesn't need to search for it again like Gnome sort does.

@@GarryDumblowskiso how does optimized gnome differ from insertion?

@@jayamarillo628 Optimized Gnome is like Insertion but it uses swaps to move the target instead of shifting everything over one space and only writing the target once to its sorted position. They both keep track of where they left off.

@@GarryDumblowski got it. So it would not look different in a visualization even if they are different.

@@jayamarillo628 Not really. In gnome sort with a small array you might be able to make out an out-of-place value moving through the array.

looks like a vaporwave background lol

Uhh, that discord link is expired, could i get a new one please?

@@werferyt6092 I thought I gave you one yesterday? discord.com/invite/2xGkKC2

@@Musicombo yeah sorry i lost it my fault:/

@@werferyt6092 No worries!!

More bases=more based

@@Coastal_Cruzer 10 bases and 10 red pills

In Place LSD Radix is just the best.

I'm a quick sort guy myself.

@@filler2013 same

omg i love merge sort too

Looks like an experience in the 4th dimensions

i absolutely love merge sort too oh my god

They connect the point where a certain number is to the point where it should be.

Earthbound ;)

@@Musicombo I DIED READING THAT

The data being sorted is (if I'm understanding it correctly) just a series of consecutive numbers from 1 all the way up to 2048 (or 1024, or 256, or 128, depending on what Musicombo feels is a reasonable amount of data for each algorithm to sort through). In this visual interpretation, the numbers are laid out in a circle like the numbers on a clock. It draws a line between where each number _is_ and where it's _supposed_ to be. When they're in their proper places, they all just look like dots, because the "where I am" and "where I should be" ends of that line are in the exact same place. When they're shuffled, though, each number's line gets dragged to wherever it randomly ended up, resulting in a rainbow rats' nest. The "chord" in the name refers to a straight line that cuts across a circle (nothing to do with musical chords as far as I know), and "disparity" means the difference between each number's intended position and its actual position. Each line is a "disparity chord". (Also, the numbers are assigned colours along the spectrum according to where they are when they're in order; so if you see a red line, that's a number that should be top centre, a blue line is a number that belongs in the bottom left, and so on.) Hope that helps it make more sense! Or at least didn't make it _more_ confusing…

All visualizations are just ways of showing the same exact array. In this one, one end of the chord is the correct indice, and the other end is where the item actually is

what whos is control my commends

what i gather is this: different places on the circle have different values starting from the top, going clockwise, the values steadily increase when they are randomized, your goal is to put these values in ascending order these are visualizations of different sorting algorithms to do that

The starting position is the position of the nunber in the set. So at the top the first and last number start. The the endpoint is a certain radiant away this corresponds to the value where 2pi is the maximun value

All visualizations are just ways of showing the same exact array. In this one, one end of the chord is the correct indice, and the other end is where the item actually is

Some number of integers. Under the name of the algorithm it'll say how many; usually a power of 2, usually smaller for slower/dumber algorithms.

Bruh no