Programming
Aptitude
Syllabus
Interview Preparation
Interview Exp.
Off Campus
0
Notifications Mark All Read
- Login
- Get Prime
0
Find the “Kth” max and min element of an array
Related Banners
Prepinsta Prime
Get Prepinsta Prime
Get all 200+ courses offered by Prepinsta
Check out our instagram
Instagram
Whatsapp
Telegram
LinkedinGet Hiring Updates
Amazon,Google,Delottie & 30+companies are hiring ! Get hiring Updates right in your inbox from PrepInsta
PrepInsta Prime
Get over 200+ course One Subscription
PrepInsta Prime
Get over 200+ course One Subscription
Get PrepInsta Prime Subscription
Companies
TCS, Cognizant, Delloite, Infosys, Wipro, CoCubes, KPMG, Amazone, ZS Associates, Accenture, Congnizant & other 50+ companies
Programming
Data Structures, Top 500 Codes, C, C++, Java Python & other 10+ subjects
Skills
Full Stack Web Development, Data Science, Machine Learning, AWS Cloud, & other 10+ skills and 20+ projects
Companies
TCS, Cognizant, Delloite, Infosys, Wipro, CoCubes, KPMG, Amazone, ZS Associates, Accenture, Congnizant & other 50+ companies
Programming
TCS, Cognizant, Delloite, Infosys, Wipro, CoCubes, KPMG, Amazone, ZS Associates, Accenture, Congnizant & other 50+ companies
Skills
TCS, Cognizant, Delloite, Infosys, Wipro, CoCubes, KPMG, Amazone, ZS Associates, Accenture, Congnizant & other 50+ companies
“Kth” max and min element in Python
In this article we will see a python program to find kth max and min element of an array. User will enter array and value of k. And then compiler will give output of k th smallest and k th largest element.
Let’s consider an example:
- array= [1, 7, 6, 8, 9, 2, 4, 5, 3, 0] , k = 2
- kth largest element: 8
- kth smallest element: 1
Algorithm
- Step 1: Call findkmax and findkmin and pass array and value of k.
Algorithm for Function findkmax
- Step 1: Sort the array in descending order using predefined function sort
- Step 2: print array[k-1] after sorting the array in descending order
Algorithm for Function findkmin
- Step 1: Sort the array in ascending order using predefined function sort
- Step 2: print array[k-1] after sorting the array in ascending order
Python code
def findkmax(k, array):
# sort the array in descending order
array.sort(reverse=True)
# Since indexing start from 0, hence if user want first number, that means index=0
print("K th maximum element is: ", array[k - 1])
def findkmin(k, array):
# sort the array in ascending order
array.sort()
# Since indexing start from 0, hence if user want first number, that means index=0
print("K th minimum element is: ", array[k - 1])
array = [1, 7, 6, 8, 9, 2, 4, 5, 3, 0]
k = 2
# call function findkmax
findkmax(k, array)
# call function findkmin
findkmin(k, array)
Output
K th maximum element is: 8 K th minimum element is: 1
Optimal solution (Python Code)
def find(k, arr, l):
# sort the array in descending order
arr.sort(reverse=True)
# Since indexing start from 0, hence if user want first number, that means index=0
print("K th maximum element is: ", arr[k - 1])
# Since the array is sort in reverse order for minimum we have to find from end
print("K th minimum element is: ", array[l - k])
array = [1, 7, 6, 8, 9, 2, 4, 5, 3, 0]
k = 2
# call function
find(k, array, len(array))
Output
K th maximum element is: 8 K th minimum element is: 1
Prime Course Trailer
Related Banners
Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription
For similar question click on the given button
Comments
Login/Signup to comment
k=int(input(‘enter k value’))
a=list(map(int,input().split()))
n=len(a)
def findkmax(k,a):
for i in range(n):
for j in range(0,n-1-i):
if a[j]a[j+1]:
a[j],a[j+1]=a[j+1],a[j]
print(a)
print(‘kin element’,a[k-1])
findkmax(k,a)
findkmin(k,a)
Hey there,
Thanks for commenting, Kindly join our Discord server, our mentors will guide you further with all your technical queries.