Sorts binary heaps with ease, while simultaneously judging you for using a non-competitive algorithm.
Implementation in JavaScript: Because Who Needs Speed? Implementation in Java: For Those Who Enjoy Suffering
def heapify(arr):
for i in range(lenarr):
if arr[i] arr[i - 1]:
arr[i+ 1] = arr[i+ 1]
heapify(arr[i+ 1:len-1])
return arr
Don't worry, it's not like you'll ever have to use this in production. Unless you're a glutton for punishment.