Optimal algorithm to return largest k elements from an array of infinite number of elements in running stream

Question

I have a running stream of integers, how can I take largest k elements from this stream at any point of time.

Answer 1

This problem is also called Heavy Hitters . Count Sketch Data Structures are the solution for this .

Ref :

• https://en.wikipedia.org/wiki/Count%E2%80%93min_sketch

Answer 2

import heapq
def klargestelements(arr1,k):
    q=heapq.nlargest(k,arr1)
    return q
k=3
arr1=[1,2,4,5,6,7]
m=klargestelements(arr1,k)
print(m)

nsmallest or nlargest methods takes in the argument k and the array in which the min/max elements are to be found