欢迎使用CSDN-markdown编辑器

josehus problem的解决

public void process(int inerval){
    if(interval <=0)
        throw new IllegalArgumentExceotin("Invaild interval");
    int length = queue.size();
    for(int i = 0; i < length; i++)
    {
        for(int j = 0; j < interval;j++)
        {
            T t = queue.remove();
            queue.add(t);
        }
        T removed = queue.remove();
        System.out.println(removed);
    }   

选择排序

public void selectSort(int[] list){
    int temp,nIndex;
for(int i = 0; i <list.length;i++)
 {
    nIdex = i;
    for(int j = i+1; j< list.length;j++)
    {
        if(list[nIndex]<list[j])
        {
            nIndex = j;
        }
        if(nIdex!=i)
        {
            temp = list[i];
            list[i] = list[nIndex];
            list[j] = temp;
        }
    }
 }
}                   

插入排序

public void insertSort(int[] list)
{
    int temp;
    for(int i = 1; i<list.length;i++)
    {
        temp = list[i];
        int j;
        for(j = i-1;j>=0;j--)
        {
            if(temp<list[j])
            {
                list[j+1] = list[j];
            }else{
                break;
            }
        }
        list[j+1] = temp;
    }
}