Sorting by ascending order
int[] Arrayorder = {3,7,4,1,2,9,8 };
int temp;
for (int i = 0; i < Arrayorder.Length-1; i++)
{
for (int j = i+1; j < Arrayorder.Length; j++)
{
if (Arrayorder[i] > Arrayorder[j])
{
temp = Arrayorder[i];
Arrayorder[i] = Arrayorder[j];
Arrayorder[j] = temp;
}
}
}
foreach (int i in Arrayorder)
{
Console.WriteLine(i);
}
Output:
Sorting by Descending order
int[] Arrayorder = {3,7,4,1,2,9,8 };
int temp;
for (int i = 0; i < Arrayorder.Length-1; i++)
{
for (int j = i+1; j < Arrayorder.Length; j++)
{
if (Arrayorder[i] < Arrayorder[j])
{
temp = Arrayorder[i];
Arrayorder[i] = Arrayorder[j];
Arrayorder[j] = temp;
}
}
}
foreach (int i in Arrayorder)
{
Console.WriteLine(i);
}
Output:
No comments:
Post a Comment