55 lines
1.3 KiB
C#
55 lines
1.3 KiB
C#
|
/*
|
||
|
|
* C# Program to Find Smallest Element in a Matrix
|
||
|
|
*/
|
||
|
|
using System;
|
||
|
|
using System.Collections.Generic;
|
||
|
|
using System.Linq;
|
||
|
|
using System.Text;
|
||
|
|
class arrsampl
|
||
|
|
{
|
||
|
|
int[,]x;
|
||
|
|
arrsampl()
|
||
|
|
{
|
||
|
|
x = new int[,] { { 11, 2, 61 }, { 42, 50, 3 } };
|
||
|
|
}
|
||
|
|
void printarray()
|
||
|
|
{
|
||
|
|
Console.WriteLine("Elements in the Given Matrix : ");
|
||
|
|
for (int i = 0; i < 2; i++)
|
||
|
|
{
|
||
|
|
for (int j = 0; j < 3; j++)
|
||
|
|
{
|
||
|
|
Console.Write(x[i, j] + "\t");
|
||
|
|
}
|
||
|
|
Console.WriteLine("\n");
|
||
|
|
}
|
||
|
|
}
|
||
|
|
int max()
|
||
|
|
{
|
||
|
|
int small = x[0, 0];
|
||
|
|
for (int i = 0; i < 2; i++)
|
||
|
|
{
|
||
|
|
for (int j = 0; j < 3; j++)
|
||
|
|
{
|
||
|
|
if (small > x[i, j])
|
||
|
|
{
|
||
|
|
small = x[i, j];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return small;
|
||
|
|
}
|
||
|
|
public static void Main()
|
||
|
|
{
|
||
|
|
arrsampl obj = new arrsampl();
|
||
|
|
obj.printarray();
|
||
|
|
Console.WriteLine("Smallest Element : {0}", obj.max());
|
||
|
|
Console.ReadLine();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
Elements in the Given Matrix :
|
||
|
|
11 2 61
|
||
|
|
42 50 3
|
||
|
|
Smallest Element : 2
|