public static void Sort(int[] list){ for (int i=0; i

for (int j = i+1; j list[j]){ currentMin = list[j]; currentMinIndex = j; } }

//swap list[i] with list[currentMinIndex] if necessary if(currentMinIndex!=1){ list[currentMinIndex] = list[i]; list[i]=currentMin; } } }

1 usage 1 implementation public interface Pairlable T{ 2 usages 1 implementation public T getFirst(); 2 usages 1 implementation public T getSecond(); \}