public int[] min(int[] a)
{
int temp, swaps;
for (int i = 0; i < a.Length; i++)
{
swaps = 0;
for (int j=0;j<a.Length-1;j++)
{
if (a[j] > a[j + 1])
{
temp = a[j];
a[j] = a[j+1];
a[j + 1] = temp;
swaps++;
}
}
if (swaps == 0)
{
break;
}
}
return a;
}Output: int[] a = { 1, 3, 8, 11, 34, 35, 43, 67,98 };Sort the given array using the bubble sort.
