HeapSort

# Heap Sort in python


  def heapify(arr, n, i):
      # Find largest among root and children
      largest = i
      l = 2 * i + 1
      r = 2 * i + 2
  
      if l < n and arr[i] < arr[l]:
          largest = l
  
      if r < n and arr[largest] < arr[r]:
          largest = r
  
      # If root is not largest, swap with largest and continue heapifying
      if largest != i:
          arr[i], arr[largest] = arr[largest], arr[i]
          heapify(arr, n, largest)
  
  
  def heapSort(arr):
      n = len(arr)
  
      # Build max heap
      for i in range(n//2, -1, -1):
          heapify(arr, n, i)
  
      for i in range(n-1, 0, -1):
          # Swap
          arr[i], arr[0] = arr[0], arr[i]
  
          # Heapify root element
          heapify(arr, i, 0)
  
  
  arr = [1, 12, 9, 5, 6, 10]
  heapSort(arr)
  n = len(arr)
  print("Sorted array is")
  for i in range(n):
      print("%d " % arr[i], end='')

Source: programiz.com

Heap sort name meaning

A sorting algorithm that works by first organizing the data to be sorted into a special type of binary tree called a heap. The heap itself has, by definition, the largest value at the top of the tree.

-1

Similar codes

0 vote323 views2 answers
Programação orientada a objetos python - Pessoa
Python
0 vote311 views1 answer
Pandas transform date format?
Python
0 vote291 views1 answer
From Player import Player
Python
0 vote330 views1 answer
How to write manual querry in drf
Python
6 votes304 views1 answer
Enter key press bind tkinter
Python
-1 vote266 views1 answer
Ten minute mail
Python
0 vote317 views1 answer
Difference between calling a function and referencing a function python
Python
1 vote303 views1 answer
Py 2 exe
Python
0 vote340 views1 answer
Python image layers
Python
1 vote334 views1 answer
What do i do if my dog eats paper
Python