# Write an efficient program for | |
# printing k largest elements in | |
# an array. Elements in array can | |
# be in any order. | |
# Time Complexity: O(NlogN) + O(k) | |
def findKLargest(arr, k): | |
arr.sort(reverse=True) | |
for i in range(0, k): | |
print(arr[i], end=" ") | |
arr = [1, 23, 12, 9, 30, 2, 50] | |
k = 3 | |
findKLargest(arr, k) |
I’m a DevOps/SRE/DevSecOps/Cloud Expert passionate about sharing knowledge and experiences. I am working at Cotocus. I blog tech insights at DevOps School, travel stories at Holiday Landmark, stock market tips at Stocks Mantra, health and fitness guidance at My Medic Plus, product reviews at I reviewed , and SEO strategies at Wizbrand.
Please find my social handles as below;
Rajesh Kumar Personal Website
Rajesh Kumar at YOUTUBE
Rajesh Kumar at INSTAGRAM
Rajesh Kumar at X
Rajesh Kumar at FACEBOOK
Rajesh Kumar at LINKEDIN
Rajesh Kumar at PINTEREST
Rajesh Kumar at QUORA
Rajesh Kumar at WIZBRAND