Answers for "find the maximum and minimum element in an array"

3

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];
}
Posted by: Guest on June-23-2021
6

find maximum number in array

#include <stdio.h>
int main() {
    int i, n;
    float arr[100];
    printf("Enter the number of elements (1 to 100): ");
    scanf("%d", &n);

    for (i = 0; i < n; ++i) {
        printf("Enter number%d: ", i + 1);
        scanf("%f", &arr[i]);
    }

    // storing the largest number to arr[0]
    for (i = 1; i < n; ++i) {
        if (arr[0] < arr[i])
            arr[0] = arr[i];
    }

    printf("Largest element = %.2f", arr[0]);

    return 0;
}
Posted by: Guest on April-28-2020
1

find maximum and second maximum number in array

#include <iostream>
int main()
{
    std::cout << "Enter 5 numbers : ";
    int arr[5];
    
    for (int i = 0; i < 5; std::cin >> arr[i++]);

    int max = arr[0], second = 0;

    for (int i = 1; i < 5; i++)
        if (arr[i] > max)
            max = arr[i];
    std::cout << "Maximum number : " << max << "n";
    bool found = false;
    for (int i = 0; i < 5; i++)
    {
        if (arr[i] == max)
            continue;
        else if (arr[i] > second)
        {
            second = arr[i];
            found = true;
        }
    }
    if (found)
        std::cout << "Second maximum numbers : " << second;
    else
        std::cout << "Second maximum number not found.";
}
Posted by: Guest on May-11-2021
1

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);
Posted by: Guest on August-12-2021

Code answers related to "find the maximum and minimum element in an array"

Browse Popular Code Answers by Language