sort an array with Fibonacci heap sort

fun sortFibonacci(nums: ArrayList<Int>) {
  val heap = FibonacciHeap<Int, Int>()
  for (num in nums) {
    heap.enqueue(num, num)
  }
  for (i in 0 until nums.size) {
    val node = heap.dequeueMin()
    nums[i] = node.key
  }
}