import java.util.List;
import java.util.ArrayList;
import java.util.Vector;
public class GenericMethodsExercises{
Swap the elements at two indices
<p>Note: Does not check if the indices are valid</p>
@param array
@param index1
@param index2
public static void swap2Original( Integer[] array, Integer index1, Integer index2 ){
Integer temp = array[index1];
array[ index1 ] = array[ index2 ];
array[ index2 ] = temp;
}
Swap the elements at two indices
<p>Note: Does not check if the indices are valid</p>
@param array
@param index1
@param index2
public static <T> void swap2( T[] array, int index1, int index2 ){
T temp = array[index1];
array[ index1 ] = array[ index2 ];
array[ index2 ] = temp;
}
Display all of the numbers (whole or real) in a list on one line
@param lst
Finds the minimum value in a list between two indices
<p>Note: Does not check if the indices are valid</p>
@param lst
@param startIndex
@param endIndex
@return
public static <T extends Comparable<T>> T findMin(List<T> lst, int startIndex, int endIndex){
T min = lst.get(startIndex);
for( int i = startIndex + 1; i <= endIndex; ++i){
if( lst.get(i).compareTo( min ) < 0 ){
min = lst.get(i);
}
}
return min;
}
public static void main( String[] args ){
Integer[] nums = {1, 2, 3};
Character[] hello = {'h', 'e', 'l', 'l', 'o'};
for( int i : nums ){
System.out.print( i );
}
System.out.println("\n");
swap2( nums, 1, 2 );
for( int i : nums ){
System.out.print( i );
}
System.out.println("\n");
for( Character c : hello ){
System.out.print( c );
}
System.out.println("\n");
swap2( hello, 4, 3 );
for( Character c : hello ){
System.out.print( c );
}
System.out.println("\n");
ArrayList<Double> numbers = new ArrayList<Double>();
numbers.add(5.0);
numbers.add(3.141596);
numbers.add(99.0);
numbers.add(100.0);
System.out.println("The minimum value of " + numbers + " is " + findMin(numbers, 0,numbers.size() - 1));
Vector<String> colors = new Vector<String>();
colors.add("blue");
colors.add("red");
colors.add("green");
colors.add("phthalo blue");
System.out.println("The minimum value of " + colors + " is " + findMin(colors, 1,colors.size() - 2));;
}
}