Print the corner elements and their sum in a 2-D matrix
Last Updated :
07 Dec, 2022
Given a 2-D matrix. The task is to print its corner elements and the sum of the corner elements.
Examples:
Input: 2 7 5 5 5 8 2
2 4 4 8 8 3 5
6 9 3 4 5 4 3
7 1 3 7 4 2 8
6 9 6 5 6 8 9
8 6 9 9 8 3 6
Output: Corner elements: 2 8 2 6, Corner_Sum = 18
Input: 6 4 6 9
2 6 1 8
5 5 2 2
4 4 1 3
Output: Corner elements: 6 4 9 3, Corner_Sum = 22
Approach: The corner element’s index in a 2-D matrix are:
- left top corner: arr[0][0]
- right top corner: arr[0][m-1]
- left bottom corner: arr[n-1][0]
- right bottom corner: arr[n-1][m-1]
Below is the implementation of the above approach.
C++
#include <iostream>
using namespace std;
const int n = 3;
const int m = 3;
void printCornerElements( int arr[][m])
{
cout << "left top corner: " << arr[0][0];
cout << "\nright top corner: " << arr[0][m - 1];
cout << "\nleft bottom corner: " << arr[n - 1][0];
cout << "\nright bottom corner: " << arr[n - 1][m - 1];
cout << "\n\nCorner elements Sum = "
<< arr[0][0] + arr[0][m - 1]
+ arr[n - 1][0] + arr[n - 1][m - 1];
}
int main()
{
int arr[][3] = {
{ 1, 2, 4 },
{ 5, 6, 8 },
{ 8, 3, 1 }
};
printCornerElements(arr);
}
|
Java
class GFG
{
static final int n = 3 ;
static final int m = 3 ;
static void printCornerElements( int arr[][])
{
System.out.println( "left top corner: " +
arr[ 0 ][ 0 ]);
System.out.println( "right top corner: " +
arr[ 0 ][m - 1 ]);
System.out.println( "left bottom corner: " +
arr[n - 1 ][ 0 ]);
System.out.println( "right bottom corner: " +
arr[n - 1 ][m - 1 ]);
System.out.print( "\nCorner elements Sum = " );
System.out.println(arr[ 0 ][ 0 ] + arr[ 0 ][m - 1 ] +
arr[n - 1 ][ 0 ] +
arr[n - 1 ][m - 1 ]);
}
public static void main(String args[])
{
int arr[][] ={{ 1 , 2 , 4 },
{ 5 , 6 , 8 },
{ 8 , 3 , 1 }};
printCornerElements(arr);
}
}
|
Python3
def printCornerElement(arr) :
n = len (arr)
m = len (arr[ 0 ])
print ( "left top corner :" ,arr[ 0 ][ 0 ])
print ( "right top corner :" ,arr[ 0 ][m - 1 ])
print ( "left bottom corner :" ,arr[n - 1 ][ 0 ])
print ( "right bottom corner :" ,arr[n - 1 ][m - 1 ])
corner_sum = (arr[ 0 ][ 0 ] + arr[ 0 ][m - 1 ] +
arr[n - 1 ][ 0 ] + arr[n - 1 ][m - 1 ])
print ( "\ncorner elements Sum :" ,corner_sum)
if __name__ = = "__main__" :
arr = [
[ 1 , 2 , 4 ],
[ 5 , 6 , 8 ],
[ 8 , 3 , 1 ],
]
printCornerElement(arr)
|
C#
using System;
class GFG
{
static int n = 3;
static int m = 3;
static void printCornerElements( int [,] arr)
{
Console.WriteLine( "left top corner: " +
arr[0, 0]);
Console.WriteLine( "right top corner: " +
arr[0, m - 1]);
Console.WriteLine( "left bottom corner: " +
arr[n - 1, 0]);
Console.WriteLine( "right bottom corner: " +
arr[n - 1, m - 1]);
Console.Write( "\nCorner elements Sum = " );
Console.Write(arr[0, 0] + arr[0, m - 1] +
arr[n - 1, 0] +
arr[n - 1, m - 1]);
}
public static void Main()
{
int [,] arr ={{1, 2, 4},
{5, 6, 8},
{8, 3, 1}};
printCornerElements(arr);
}
}
|
PHP
<?php
$n = 3;
$m = 3;
function printCornerElements(& $arr )
{
global $n , $m ;
echo "left top corner: " .
$arr [0][0];
echo "\nright top corner: " .
$arr [0][ $m - 1];
echo "\nleft bottom corner: " .
$arr [ $n - 1][0];
echo "\nright bottom corner: " .
$arr [ $n - 1][ $m - 1];
echo "\n\nCorner elements Sum = " .
( $arr [0][0] + $arr [0][ $m - 1] +
$arr [ $n - 1][0] +
$arr [ $n - 1][ $m - 1]);
}
$arr = array ( array ( 1, 2, 4 ),
array ( 5, 6, 8 ),
array ( 8, 3, 1 ));
printCornerElements( $arr );
?>
|
Javascript
<script>
var n = 3;
var m = 3;
function printCornerElements(arr)
{
document.write( "left top corner: " +
arr[0][0] + "<br/>" );
document.write( "right top corner: " +
arr[0][m - 1] + "<br/>" );
document.write( "left bottom corner: " +
arr[n - 1][0] + "<br/>" );
document.write( "right bottom corner: " +
arr[n - 1][m - 1] + "<br/>" );
document.write( "<br/>Corner elements Sum = " );
document.write(arr[0][0] + arr[0][m - 1] +
arr[n - 1][0]
+ arr[n - 1][m - 1]);
}
var arr = [ [ 1, 2, 4 ],
[ 5, 6, 8 ],
[ 8, 3, 1 ] ];
printCornerElements(arr);
</script>
|
Output
left top corner: 1
right top corner: 4
left bottom corner: 8
right bottom corner: 1
Corner elements Sum = 14
Time Complexity: O(1)
Auxiliary Space: O(1)
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...