OpenGL Animation - Heap Sort

[jrzzl33]

@brunocafeo did you animate this with a toaster?

[ChiroExplainPlox]

isn't tree selection less of a mindfuck and faster ?

[AstralAbraxas]

@ChiroExplainPlox watching this is confusing... but heapsort is O(nlogn) and competes with quicksort in effeciency. Quicksort if used right is slightly more efficient but has a worst case time of O(n^2). It's an excellent choice when needing to sort over a 1000 elements.

[rasmeta]

@AstralAbraxas heapsort is also more immune to those stupid attacks on servers than quicksort (because quicksort hates sorted data - gets O(n) complexity...), so it's much more secure in many apps ;)

[Piotr3kM]

Very nice! But resolution could be better ;)

[harish223]

nice creativity.

[Alarindris]

So who won?

[putzmitt3l]

@Alarindris man that's not a game. it's a sorting method used to arrange elements of an array depending on the characteristics they are sorted. Example with numbers: 5.6.7.9.8.10.1.4.3.2 ->(after sorting) 1.2.3.4.5.6.7.8.9.10

[ChiroExplainPlox]

@putzmitt3l

jokes, develloper don't get them.

[manish9mati]

great work!!!!!

[enriquearaizam]

Nice work.

[fermixx]

thats a lot of movements. seems like selection sort would move less elements and take less time.

however things are not as they seem

[stefys]

@fermixx of course; this algorithm is efficient when sorting more numbers. for sorting around 15 numbers, O(n^2) algorithms might be faster than O(nlogn) algorithms.

[willowtreephoto]

Intuitively, it doesn't look efficient watching this.

Enjoyable video, would watch again.

[frosty1433]

supposed to be faster?

[kotapaka]

@frosty1433 Are you stupid? This is an animation, not an actual run.

[binary132]

righteous.

[bomi76]

sehr geil!

[tottis44]

amazing!!

[peterwilson69]

nice

[hataryou]

nice vid! looks cool

[snasebrase]

OMG! this is great.