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

4 votes243 views1 answer
Change default option optionmenu tkinter
Python
0 vote247 views1 answer
Python reduce function to sum array
Python
2 votes233 views1 answer
Calculate root mean square error python
Python
0 vote218 views1 answer
Subplots whitespace
Python
0 vote246 views1 answer
Print Wavelet modes
Python
3 votes247 views2 answers
Moving element to last position in a list python
Python
0 vote267 views1 answer
.lift tkinter
Python
0 vote230 views1 answer
Pouring 8 litres into 2 empty container of size 3 and 5 to get 4 litre in any container
Python
0 vote245 views1 answer
Python item defined in different definition stackoverflow
Python
22 votes229 views6 answers
Add python to path
Python