Breaking News: Grepper is joining You.com. Read the official announcement!

How to find min and max in an array by using divide and conquer (Java)

Awful Anaconda answered on March 7, 2023 Popularity 1/10 Helpfulness 1/10

answer How to find min and max in an array by using divide and conquer (Java)

How to find min and max in an array by using divide and conquer (Java)

Comment

findMinMaX

// Java program of above implementation
public class GFG {
	/* Class Pair is used to return two values from
	* getMinMax() */
	static class Pair {

		int min;
		int max;
	}

	static Pair getMinMax(int arr[], int low, int high)
	{
		Pair minmax = new Pair();
		Pair mml = new Pair();
		Pair mmr = new Pair();
		int mid;

		// If there is only one element
		if (low == high) {
			minmax.max = arr[low];
			minmax.min = arr[low];
			return minmax;
		}

		/* If there are two elements */
		if (high == low + 1) {
			if (arr[low] > arr[high]) {
				minmax.max = arr[low];
				minmax.min = arr[high];
			}
			else {
				minmax.max = arr[high];
				minmax.min = arr[low];
			}
			return minmax;
		}

		/* If there are more than 2 elements */
		mid = (low + high) / 2;
		mml = getMinMax(arr, low, mid);
		mmr = getMinMax(arr, mid + 1, high);

		/* compare minimums of two parts*/
		if (mml.min < mmr.min) {
			minmax.min = mml.min;
		}
		else {
			minmax.min = mmr.min;
		}

		/* compare maximums of two parts*/
		if (mml.max > mmr.max) {
			minmax.max = mml.max;
		}
		else {
			minmax.max = mmr.max;
		}

		return minmax;
	}

	/* Driver program to test above function */
	public static void main(String args[])
	{
		int arr[] = { 1000, 11, 445, 1, 330, 3000 };
		int arr_size = 6;
		Pair minmax = getMinMax(arr, 0, arr_size - 1);
		System.out.printf("\nMinimum element is %d",
						minmax.min);
		System.out.printf("\nMaximum element is %d",
						minmax.max);
	}
}

Popularity 1/10 Helpfulness 1/10 Language javascript

Source: afteracademy.com

Tags: divide-and-conquer find max min using whatever

Link to this answer
Share Copy Link

Contributed on Mar 07 2023

Awful Anaconda

0 Answers Avg Quality 2/10

How to find min and max in an array by using divide and conquer (Java)

Contents

More Related Answers

How to find min and max in an array by using divide and conquer (Java)

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.