int[] arr = new int[] { 1, 5, 6, 3, 9, 23 };
int maxvalue = arr[0];
int secondmaxvalue = 0;
for (int i = 0; i < arr.Length; i++)
{
if (maxvalue < arr[i])
{
secondmaxvalue = maxvalue;
maxvalue = arr[i];
}
else if (secondmaxvalue < arr[i])
{
secondmaxvalue = arr[i];
}
}
Console.WriteLine(maxvalue);
Console.WriteLine(secondmaxvalue);
Or else we can use linq or lemda exp like this
By Linq->
var checksecondlagestnumber = (from ITEM in arr orderby ITEM descending select ITEM).Skip(1).FirstOrDefault();
By Lemda->
var checksecondlagestnumber= arr.OrderByDescending(ITEM => ITEM).Select(ITEM => ITEM).Skip(1).FirstOrDefault();
int maxvalue = arr[0];
int secondmaxvalue = 0;
for (int i = 0; i < arr.Length; i++)
{
if (maxvalue < arr[i])
{
secondmaxvalue = maxvalue;
maxvalue = arr[i];
}
else if (secondmaxvalue < arr[i])
{
secondmaxvalue = arr[i];
}
}
Console.WriteLine(maxvalue);
Console.WriteLine(secondmaxvalue);
Or else we can use linq or lemda exp like this
By Linq->
var checksecondlagestnumber = (from ITEM in arr orderby ITEM descending select ITEM).Skip(1).FirstOrDefault();
By Lemda->
var checksecondlagestnumber= arr.OrderByDescending(ITEM => ITEM).Select(ITEM => ITEM).Skip(1).FirstOrDefault();
No comments:
Post a Comment