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

1 vote131 views1 answer
How to average in python with loop
Python
9 votes147 views6 answers
Dropna pandas
Python
0 vote140 views1 answer
How to find the closest value in column python
Python
0 vote144 views1 answer
Microsoft python
Python
0 vote139 views1 answer
Comment a lot of lines python vscode
Python
1 vote160 views1 answer
Indices of true boolean array pyton
Python
4 votes138 views1 answer
End python program
Python
1 vote168 views1 answer
Requirements.py for flask
Python Flask
3 votes139 views2 answers
Scikit learn lda
Python
40 votes153 views6 answers
How to install beautiful soup
Python