Block Merge Sort (WikiSort)

preview_player
Показать описание
Visualization and "audibilization" of "Block Merge Sort" algorithm.
The animation is slowed down during the video to give you time to see how the algorithm works. Compared elements are blue, moved elements are red.
  1. Timo Bingmann
  2. Sorting Algorithm
  3. yt:quality=high
  4. Merge Sort
Рекомендации по теме
Block Merge Sort 0:01:02

Block Merge Sort (WikiSort)

Sound of Sorting 0:00:13

Sound of Sorting - Block Merge Sort (WikiSort)

WIP Adaptive Block 0:00:27

WIP Adaptive Block Merge Sort

The Perfect Sorting 0:32:11

The Perfect Sorting Algorithm?? Block Sort Explained (Wiki Sort, Grail Sort)

WikiSort - Scatter 0:03:11

WikiSort - Scatter Plot

Parallel Block Merge 0:00:37

Parallel Block Merge Sort

Block Merge Sorts 0:21:26

Block Merge Sorts with 5 Different Rotation Algorithms

WikiSort - Bar 0:02:24

WikiSort - Bar Graph

WikiSort - Color 0:02:31

WikiSort - Color Circle

Ectasort with Wikisort-style 0:26:16

Ectasort with Wikisort-style Keys

(Reduced Insertion) Block 0:05:09

(Reduced Insertion) Block Merge Sort

[Sound of Sorting 0:05:34

[Sound of Sorting mod] Block Merge Sort (GrailSort)

Block sort, or 0:00:24

Block sort, or block merge sort (animation)

Improved Block Selection 0:01:21

Improved Block Selection Merge Sort

Block Merge Sorts 0:10:12

Block Merge Sorts with and without External Buffers

Wikisort with O(n) 0:16:31

Wikisort with O(n) External Buffer

GrailSort - A 0:05:28

GrailSort - A stable, in-place, worst-case O(n log n) sort

heliumSort - Adaptive 0:02:12

heliumSort - Adaptive block merge sort prototype

Sorting Algorithims With 0:09:41

Sorting Algorithims With Shuffled Quintic (Part 1)

GrailSort Redistributing Its 0:01:34

GrailSort Redistributing Its Internal Buffer

Visualization of 24 0:02:08

Visualization of 24 Sorting Algorithms In 2 Minutes

Block Sort Demo 0:21:23

Block Sort Demo

Sorting Algorithms but 0:23:36

Sorting Algorithms but the Computer Makes Mistakes (LIGHT / SOUND WARNING)

TimSort on Different 0:03:19

TimSort on Different Distributions of Data

Комментарии
Автор

im always so proud of the computer when it finishes sorting

flylikeabeetv
Автор

0:46 - 0:55 it's The Addams family.

Thrna_
Автор

The authors of the algorithm want it to be called "block merge-sort", which hopefully can nicknamed "block sort". WikiSort is just the name of an implementation!

BonzaiThePenguin
Автор

A very interesting, efficient, stable sort. Complex. Can use only O(1) extra space, but performs better if you give it more space to work with.

dlwatib
Автор

This pleases me. A little more than it should. I can listen and watch this all day. o.o

TheSentientCloud
Автор

i teared up a little bit when i watched this...one simply can't live without this sort...

damndaniel
Автор

Would be nice to see a table of the results of these videos to get an overview.
name / comparisons / accesses / sort time (real value)

Автор

Does someone know how this sorting algorithm work?

prizmincordik
Автор

Your implementation crashes desktop application for lists up to 7 items.

groszak
Автор

Please do grailsort(it also a block merge sort)!!

hbtnguyen
Автор

It's a stable sort, but it doesn't look like it, because all the items are unique

smaybius
Автор

Funny how you didn't demonstrate it's O(1) extra space behavior (as the merge buffers weren't large enough to not fit into that fixed sized buffer of 512 typically used)

paulstelian
Автор

where is the John von Neumann source code ?

alexanderzhang
Автор

This is Merge sort's Cool retro video game one

thermitty_qxr
Автор

0:11 פה אתה חי טל ליבני. אתה פשוט מעצבן שאומר לי לשתוק כל החיים דיי איתך.

anyad