import java.util.Collections;
import java.util.ArrayList;
public class Insert
{
    public static void main(String[] args)
    {
        ArrayList<String> x = new ArrayList<>();
        x.add("a");
        x.add("b");
        x.add("c");
        System.out.println(x);
        swap(x,0,1);
        System.out.println(x);


    }
    public  static <T extends Comparable> void swap(ArrayList<T> x, int k, int l)
    {
        if(k != l)
        {
            T tmp = x.get(k);
            x.set(k, x.get(l));
            x.set(l, tmp);
        }
    }
    public static <T extends Comparable> void insertionSort(ArrayList<T> x)
    {
        int divide = 1
        //increment divide
        divide++;
        //trickle downo
        //where is the entry we need to trickle down?
        while(
            )
        {

        }


    }
}