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

3 votes298 views6 answers
2+2
Python
148 votes333 views10 answers
Grepper
Python
0 vote287 views1 answer
Pyqt create a qmenu on a button click
Python
0 vote282 views1 answer
Qlistwidget item clicked event pyqt
Python
6 votes295 views2 answers
Remove all html tags and text from string python
Python
0 vote284 views1 answer
How to change array of arrays to simpe array
Python
2 votes283 views2 answers
Standard module
Python
7 votes297 views4 answers
Force utf-8 encoding python
Python
0 vote286 views1 answer
How to set geometry to full screen in pyqt5
Python
0 vote275 views1 answer
Change python from 3.8 to 3.7
Python