Sorting algorithm: Direct selection method

DirectSelection.java

	public void sort(int[] elements) {
		int posMin;
		
		for (int i =  0; i < elements.length-1; i++) {
			posMin = findPosMin(elements, i); //O(n)
			int temp = elements[i];
			elements[i] = elements[posMin];
			elements[posMin] = temp;
		}
	}

	public int findPosMin(int[] elements, int firstElement) {
		int value = Integer.MAX_VALUE;
		int pos = Integer.MAX_VALUE;
		for (int i = firstElement; i < elements.length; i++){
			if (elements[i] < value){
				value = elements[i];	
				pos = i;
			}
		}
		return pos;
	}