Heap Sort Challenge 3: The Binary Brawl

Sort a list of integers in binary using the power of binary heapify!

Learn Binary Heapify Heap Sort Tips Heap Sort Tricks 
		
			// Example list: [4, 2, 5, 1, 3, 6, 4]
			int[] arr = [4, 2, 5, 1, 3, 6, 4]
			heapify(arr, 0, arr.length - 1)
  1. Example 1
  2. Example 2
  3. Example 3
  1. Challenge 4: Binary Heap Madness
  2. Challenge 5: Heap Sort Showdown