Merge-sort with Transylvanian-saxon (German) folk dance

Created at Sapientia University, Tirgu Mures (Marosvásárhely), Romania.
Directed by Kátai Zoltán and Tóth László.
In cooperation with "Maros Művészegyüttes", Tirgu Mures (Marosvásárhely), Romania.
Choreographer: Füzesi Albert.
Video: Lőrinc Lajos, Körmöcki Zoltán.
Supported by "Szülőföld Alap", MITIS (NGO) and evoline company.

• Category

  Education

[bithir]

I want a remake - use 2 threads for the merge sort.

[wqtpuu]

They sing "Teile und herrsche" as i understand it, which means in english "divide and conquer"

[sixthat]

The computer merged the divided arrays a[0...1] and a[2...4]. As the first entries in the respective sub-arrays are the lowest ones, you can simply compare those two to determine the lowest entry. If a[0]<a[2] then a[0] has to be the lowest entry in the subarray a[0...4] else a[2] has to be the lowest one. In this example a[0]=2 and a[2]=0 hence a[2]<a[0] and in our new subarray a[0...4] our first entry a'[0]=min(a[0],a[2])=a[2]=0

[Tanlin2021]

this is awesome

[Тодор Бончев]

What was the computer doing at 1:37?

[AvntXardE]

yes but the paradigma of this algorithm is called "divide and conquer". it's the offical IT-expression.

[Mahesh bboy]

sorting took 4:16 min to complete

[warren010h]

I already understand mergeSort but really enjoyed this demonstration of it :) That was interesting.

[Dominik Köllges]

Actually that would mean "divide and reign" as conquer would be more like "erobern" in german :3

[patyongpradit]

7 se gândește: De ce are 6 trebuie să fie atât de greu

[Shyam Ravikumar]

Bringing computers to life..