find kth max and min element in an array
#include <bits/stdc++.h>
using namespace std;
int main(){
const int size = 10;
int k = 3; //Can be any number smalled than size
int array[size] = {5,2,8,34,73,82,1,6,19,29};
sort(array,array+size);
int smallestKthElement = array[k-1];
int largestKthElement = array[size-k];
}Minimum and maximum element in an Array
def divideAndConquer_Max(arr, ind, len):
maximum = -1;
if (ind >= len - 2):
if (arr[ind] > arr[ind + 1]):
return arr[ind];
else:
return arr[ind + 1];
maximum = divideAndConquer_Max(arr, ind + 1, len);
if (arr[ind] > maximum):
return arr[ind];
else:
return maximum;
def divideAndConquer_Min(arr, ind, len):
minimum = 0;
if (ind >= len - 2):
if (arr[ind] < arr[ind + 1]):
return arr[ind];
else:
return arr[ind + 1];
minimum = divideAndConquer_Min(arr, ind + 1, len);
if (arr[ind] < minimum):
return arr[ind];
else:
return minimum;
if __name__ == '__main__':
minimum, maximum = 0, -1;
# array initialization
arr = [6, 4, 8, 90, 12, 56, 7, 1, 63];
maximum = divideAndConquer_Max(arr, 0, 9);
minimum = divideAndConquer_Min(arr, 0, 9);
print("The minimum number in the array is: ", minimum);
print("The maximum number in the array is: ", maximum);kth largest element in an array javascript
function nthlargest(arra,highest){
var x = 0,
y = 0,
z = 0,
temp = 0,
tnum = arra.length,
flag = false,
result = false;
while(x < tnum){
y = x + 1;
if(y < tnum){
for(z = y; z < tnum; z++){
if(arra[x] < arra[z]){
temp = arra[z];
arra[z] = arra[x];
arra[x] = temp;
flag = true;
}else{
continue;
}
}
}
if(flag){
flag = false;
}else{
x++;
if(x === highest){
result = true;
}
}
if(result){
break;
}
}
return (arra[(highest - 1)]);
}
console.log(nthlargest([ 43, 56, 23, 89, 88, 90, 99, 652], 4));Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
