import java.math.BigInteger;
import java.util.Arrays;
/**
* You now geet to read my JavaDoc in this assignmeant.
* This assignement will give you some practice in working with arrays.
*/
public class ArrayGames
{
    /** 
    * test your code here
    * @param args command-line arguments if you want them.
    */
    public static void main(String[] args)
    {
    }
    /**
    * @param arr an integer array with at least two emements
    * @return the second largest element in the array
    */
    public static int seccondLargest(int[] arr)
    {
        return 0;
    }
    /**
    * @param arr an array of strings
    * @param snipPoint a string
    * @return a copy of the subarray of <code>arr</code>
    * snipped at <code>snipPoint</code>.  If <code>snipPoint</code>
    * is not present in the array, return a copy of the array.
    */
    public static String[] snipAt(String[] arr, String snipPoint)
    {
        return null;
    }
    /**
    * @param arr an array of strings
    * @param j a valid index in the array
    * @param k a valid index in the array
    * This swaps the entries of <code>arr</code> at indices 
    * <code>j</code> and <code>k</code>
    */
    public static void swap(String [] arr, int j, int k)
    {
    }
    /**
    * @param arr an array of integers
    * This walks up to each pair of neighboring elmeents
    * of <code>arr</code>, starting at index 0  and swaps
    * the two elements if they are not in ascending order.
    * It continues until it bumps up against the end of
    * the array.
    */ 
    public static void soapy(int[] arr)
    {
    }
    /**
    * @param arr an array of <code>BigInteger</code>s
    * This walks up to each pair of neighboring elmeents
    * of <code>arr</code>, starting at index 0  and swaps
    * the two elements if they are not in ascending order.
    * It continues until it bumps up against the end of
    * the array.
    */ 
    public static void bigSoapy(BigInteger[] arr)
    {
    }
}