K largest elements Python

PROGRAM TO FIND K-LARGEST/SMALLEST ELEMENTS IN A HEAP




def FirstKelements(arr,size,k):

     

    # Creating Min Heap for given

    # array with only k elements

    # Create min heap with priority queue

    minHeap = []

    for i in range(k):

        minHeap.append(arr[i])

     

    # Loop For each element in array

    # after the kth element

    for i in range(k, size):

        minHeap.sort()

         

        # If current element is smaller

        # than minimum ((top element of

        # the minHeap) element, do nothing

        # and continue to next element

        if (minHeap[0] > arr[i]):

            continue

             

        # Otherwise Change minimum element

        # (top element of the minHeap) to

        # current element by polling out

        # the top element of the minHeap

        else:

            minHeap.pop(0)

            minHeap.append(arr[i])

             

    # Now min heap contains k maximum

    # elements, Iterate and print  

    for i in minHeap:

        print(i, end = " ")

 

# Driver code

arr=[11, 3, 2, 1, 15, 5, 4,45, 88, 96, 50, 45]

size = len(arr)

 

# Size of Min Heap

k=3

FirstKelements(arr, size, k)

OUTPUT:

50 88 96 

CREDITS: https://www.geeksforgeeks.org/k-largestor-smallest-elements-in-an-array/