Breaking News: Grepper is joining You.com. Read the official announcement!

heapsort python

Add Answer

Federiko98 answered on September 4, 2021 Popularity 10/10 Helpfulness 2/10

answer heapsort python

related how to implement heap in python

related How to perform heap sort, in Python?

related python heapify

heapsort python

Comment

def buildHeap(lista, n):
    for i in range(n//2 - 1, -1, -1):
        heapify(lista, n, i)

def heapify(lista, n, i):
    largest = i  
    left = (2 * i) + 1    
    right = (2 * i) + 2 

    if left < n and lista[largest] < lista[left]:
        largest = left

    if right < n and lista[largest] < lista[right]:
        largest = right

    if largest != i:
        lista[i], lista[largest] = lista[largest], lista[i] 
        heapify(lista, n, largest) 

def heapSort(lista):
    n = len(lista)
    buildHeap(lista, n)
    
    for i in range(n-1, 0, -1):
        lista[i], lista[0] = lista[0], lista[i]
        heapify(lista, i, 0)

Popularity 10/10 Helpfulness 2/10 Language python

Source: Grepper

Tags: heapsort python

Link to this answer
Share Copy Link

Contributed on Sep 04 2021

Federiko98

0 Answers Avg Quality 2/10

Closely Related Answers

how to implement heap in python

Comment

# Python3 program to demonstrate working of heapq
  
from heapq import heapify, heappush, heappop
  
# Creating empty heap
heap = []
heapify(heap)
  
# Adding items to the heap using heappush function
heappush(heap, 10)
heappush(heap, 30)
heappush(heap, 20)
heappush(heap, 400)
  
# printing the value of minimum element
print("Head value of heap : "+str(heap[0]))
  
# printing the elements of the heap
print("The heap elements : ")
for i in heap:
    print(i, end = ' ')
print("\n")
  
element = heappop(heap)
  
# printing the elements of the heap
print("The heap elements : ")
for i in heap:
    print(i, end = ' ')

Popularity 10/10 Helpfulness 3/10 Language python

Source: www.geeksforgeeks.org

Tags: heap

Link to this answer
Share Copy Link

Contributed on Aug 13 2022

Good Grasshopper

0 Answers Avg Quality 2/10

How to perform heap sort, in Python?

Comment

"""
The below code provides an implementation 
for the heap sort algorithm 
(https://en.wikipedia.org/wiki/Heapsort). 
Sorting a list via heap sort is a two-step 
process:
1. In first step, transform the original list
into a heap. 
2. In second step, sort the list by placing
the values in order at end of list. 

Let n be the number of elements in list to sort.

Time complexity: O(nlog2(n))
Space complexity: O(1), sorting is done in place.
"""
from heapq import heapify


def heap_sort(list):
    n = len(list)
    # First step: turn list into a heap
    heapify(list)
    print(list)
    # Second step: repeatedly place next
    # smallest value at end of the list
    for idx in range(n-1, 0, -1):
        swap(0, idx, list)
        bubble_down(0, idx-1, list)


def swap(idx1, idx2, list):
    list[idx1], list[idx2] = list[idx2], list[idx1]


def bubble_down(current_idx, last_idx, heap):
    # Method used to restore heap order property when violated
    child_one_idx = current_idx * 2 + 1
    while child_one_idx <= last_idx:
        child_two_idx = current_idx * 2 + 2 if current_idx*2 + 2 <= last_idx else -1

        if child_two_idx > -1 and heap[child_two_idx] < heap[child_one_idx]:
            idx_to_swap = child_two_idx
        else:
            idx_to_swap = child_one_idx

        if heap[idx_to_swap] < heap[current_idx]:
            swap(current_idx, idx_to_swap, heap)
            current_idx = idx_to_swap
            child_one_idx = current_idx * 2 + 1
        else:
            return


list = [1, 10, 4, 3, 2]
heap_sort(list)
# Descending order
print(list)  # [10, 4, 3, 2, 1]
# Ascending order
list.reverse()
print(list)  # [1, 2, 3, 4, 10]

Popularity 10/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: heap

Link to this answer
Share Copy Link

Contributed on Jun 05 2022

Wissam

0 Answers Avg Quality 2/10

python heapify

Comment

-1

Input: nums = [1,3,2,3,1]
Output: 2
Explanation: The reverse pairs are:
(1, 4) --> nums[1] = 3, nums[4] = 1, 3 > 2 * 1
(3, 4) --> nums[3] = 3, nums[4] = 1, 3 > 2 * 1

Popularity 10/10 Helpfulness 1/10 Language python

Source: leetcode.com

Tags: python py

Link to this answer
Share Copy Link

Contributed on Mar 28 2023

Mehari Tesfaye

0 Answers Avg Quality 2/10

heapsort python

Contents

More Related Answers

heapsort python

Closely Related Answers

how to implement heap in python

How to perform heap sort, in Python?

python heapify

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.