public void SelectionSort(int[] A) {
		//O(n^2)
		int i = 0, j = 0;
		for (i = 0; i < A.length - 1; i++) {
			int min = i;
			for (j = i + 1; j < A.length; j++) {
				if (A[min] > A[j]) {
					min = j;
				}
			}
			// swap the min element
			if (min != i) {
				int temp = A[i];
				A[i] = A[min];
				A[min] = temp;
			}
		}

	}