Insertion Sort

public class InsertionSort {
    public static int[] sort (int[] arr)
    {
        int value=0;
        int j=0;
        boolean done=false;

        for (int i =1; i < arr.length;i++)
        {
            value = arr[i];
            j=i-1;
            done=false;

            do {
                if (arr[j] > value)
                {
                    arr[j+1] = arr[j];
                    j = j-1;
                    if (j < 0)
                        done = true;
                } else {
                    done  = true;
                }

            } while (!done);
            arr[j+1] = value;
        }
        return arr;
    }
}