public static int[] InsertionSort(int[] a)
{
	for (int i = 1; i < a.Length; i++)
	{
		int k = i;
		while (a[k] < a[k - 1] && k > 0)
		{
			int temp = a[k];
			a[k] = a[k - 1];
			a[k - 1] = temp;
			k--;
		}
 
	}
	return a;
}

public static int[] SelectionSort(int[] a)
{
	for (int i = 0; i < a.Length; i++)
	{
		int min = i;
		for (int j = i; j < a.Length; j++)
	  {
		   if (a[min] > a[j])
			{
				min = j;
			}
		}
		if (i != min)
		{
			int temp = a[min];
			a[min] = a[i];
			a[i] = temp;
 
		}
	}
	return a;
 
}

public static int[] BubbleSort(int[] a)
{
	for (int i = 0; i < a.Length; i++)
	{
		for (int j = 0; j < a.Length; j++)
		{
			if (a[i] < a[j])
			{
				int temp = a[i];
				a[i] = a[j];
				a[j] = temp;
			}
		}
	}
	return a;        
}