JAVA 插入排序 穩定__部分ACM演算法題解

package huawei;public final class Demo {/*根據重量排序後，輸出帽子顏色 * 舉例：5隻小白鼠，重量分別為15 30 5 9 30，帽子顏色依次為CL_RED, CL_BLUE, CL_BLUE, CL_YELLOW, CL_GRAY， * 則排序後的輸出的帽子顏色序列應該為CL_BLUE, CL_YELLOW, CL_RED, CL_BLUE, CL_GRAY。如果沒有小白鼠，輸出null。輸入參數：小白鼠數組*/public static MOUSE_COLOR[] sortMouse(Mouse[] mouse ){if(mouse==null||mouse.length<=0) return null;MOUSE_COLOR[] result=new MOUSE_COLOR[mouse.length];//插入排序for(int i=1;i<mouse.length;i++){int j;for(j=i-1;j>=0;j--)if(mouse[j].weight<=mouse[i].weight)break;Mouse nowMouse=new Mouse(mouse[i].weight,mouse[i].color);for(int k=i-1;k>j;k--){mouse[k+1].weight=mouse[k].weight;mouse[k+1].color=mouse[k].color;}mouse[j+1]=nowMouse;}for(int i=0;i<mouse.length;i++){result[i]=mouse[i].color;}return result;}}