OpenGL Animation - Heap Sort

Heap Sort Animation

Category:

Education

Tags:

• OpenGL
• Sort
• Heap

[Alarindris]

So who won?

[snasebrase]

OMG! this is great.

[jrzzl33]

@brunocafeo did you animate this with a toaster?

[kotapaka]

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

[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 ;)

[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.

[ChiroExplainPlox]

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

[ChiroExplainPlox]

@putzmitt3l

jokes, develloper don't get them.

[Piotr3kM]

Very nice! But resolution could be better ;)

[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.

[harish223]

nice creativity.

[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