Javascript Program for Maximum and Minimum in a square matrix.
Last Updated :
20 Mar, 2023
Given a square matrix of order n*n, find the maximum and minimum from the matrix given.
Examples:
Input : arr[][] = {5, 4, 9,
2, 0, 6,
3, 1, 8};
Output : Maximum = 9, Minimum = 0
Input : arr[][] = {-5, 3,
2, 4};
Output : Maximum = 4, Minimum = -5
Naive Method :
We find maximum and minimum of matrix separately using linear search. Number of comparison needed is n2 for finding minimum and n2 for finding the maximum element. The total comparison is equal to 2n2.
JavaScript
// JavaScript Program for finding maximum
// and minimum in a matrix
function maxMin(arr, n){
let min = +2147483647;
let max = -2147483648;
// loop to find the maximum element
for(let i = 0; i<n; i++){
for(let j = 0; j<n; j++){
if(max < arr[i][j]) max = arr[i][j];
}
}
// for finding the minimum element
for(let i = 0; i<n; i++){
for(let j = 0; j<n; j++){
if(min > arr[i][j]) min = arr[i][j];
}
}
console.log("Maximum = " + max + ", Minimum = " + min);
}
// driver code for above approach
let arr = [ [ 5, 9, 11 ], [ 25, 0, 14 ], [ 21, 6, 4 ] ];
maxMin(arr, 3);
// THIS CODE IS CONTRIBUTED BY KIRTI AGARWAL(KIRTIAGARWAL23121999)
OutputMaximum = 25, Minimum = 0
Time Complexity: O(N^2)
Auxiliary Space: O(1)
Pair Comparison (Efficient method):
Select two elements from the matrix one from the start of a row of the matrix another from the end of the same row of the matrix, compare them and next compare smaller of them to the minimum of the matrix and larger of them to the maximum of the matrix. We can see that for two elements we need 3 compare so for traversing whole of the matrix we need total of 3/2 n2 comparisons.
Note : This is extended form of method 3 of Maximum Minimum of Array.
JavaScript
<script>
// Javascript program for finding maximum
// and minimum in a matrix.
let MAX = 100;
// Finds maximum and minimum
// in arr[0..n-1][0..n-1]
// using pair wise comparisons
function maxMin(arr,n)
{
let min = +2147483647;
let max = -2147483648;
// Traverses rows one by one
for(let i = 0; i < n; i++)
{
for(let j = 0; j <= n / 2; j++)
{
// Compare elements from beginning
// and end of current row
if (arr[i][j] > arr[i][n - j - 1])
{
if (min > arr[i][n - j - 1])
min = arr[i][n - j - 1];
if (max< arr[i][j])
max = arr[i][j];
}
else
{
if (min > arr[i][j])
min = arr[i][j];
if (max < arr[i][n - j - 1])
max = arr[i][n - j - 1];
}
}
}
document.write("Maximum = " + max +
", Minimum = " + min);
}
// Driver Code
let arr = [ [ 5, 9, 11 ],
[ 25, 0, 14 ],
[ 21, 6, 4 ] ];
maxMin(arr, 3);
// This code is contributed by sravan kumar
</script>
Output:
Maximum = 25, Minimum = 0
Time Complexity: O(N^2)
Auxiliary Space: O(1)
Please refer complete article on Maximum and Minimum in a square matrix. for more details!
Similar Reads
Javascript Program to Find maximum element of each row in a matrix Given a matrix, the task is to find the maximum element of each row.Examples: Input : [1, 2, 3] [1, 4, 9] [76, 34, 21]Output :3976Input : [1, 2, 3, 21] [12, 1, 65, 9] [1, 56, 34, 2]Output :216556Approach : Approach is very simple. The idea is to run the loop for no_of_rows. Check each element inside
2 min read
Javascript Program for Diagonally Dominant Matrix In mathematics, a square matrix is said to be diagonally dominant if for every row of the matrix, the magnitude of the diagonal entry in a row is larger than or equal to the sum of the magnitudes of all the other (non-diagonal) entries in that row. More precisely, the matrix A is diagonally dominant
2 min read
Javascript Program for Largest Sum Contiguous Subarray Write an efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers that has the largest sum. Kadane's Algorithm:Initialize: max_so_far = INT_MIN max_ending_here = 0Loop for each element of the array (a) max_ending_here = max_ending_here + a[i] (b) if(max_so_f
5 min read
Java Program for Maximum and Minimum in a square matrix. Given a square matrix of order n*n, find the maximum and minimum from the matrix given. Examples: Input : arr[][] = {5, 4, 9, 2, 0, 6, 3, 1, 8}; Output : Maximum = 9, Minimum = 0 Input : arr[][] = {-5, 3, 2, 4}; Output : Maximum = 4, Minimum = -5 Naive Method : We find maximum and minimum of matrix
3 min read
Maximum and Minimum in a square matrix. Given a square matrix of order n*n, find the maximum and minimum from the matrix given. Examples: Input : arr[][] = {5, 4, 9, 2, 0, 6, 3, 1, 8}; Output : Maximum = 9, Minimum = 0 Input : arr[][] = {-5, 3, 2, 4}; Output : Maximum = 4, Minimum = -5 Naive Method : We find maximum and minimum of matrix
10 min read
Python Program for Maximum and Minimum in a square matrix. Given a square matrix of order n*n, find the maximum and minimum from the matrix given. Examples: Input : arr[][] = {5, 4, 9, 2, 0, 6, 3, 1, 8}; Output : Maximum = 9, Minimum = 0 Input : arr[][] = {-5, 3, 2, 4}; Output : Maximum = 4, Minimum = -5 Naive Method : We find maximum and minimum of matrix
3 min read