{"id":556,"date":"2015-04-22T17:41:35","date_gmt":"2015-04-22T09:41:35","guid":{"rendered":"https:\/\/ai.zhousir.top\/?p=556"},"modified":"2026-08-18T12:09:31","modified_gmt":"2026-08-18T04:09:31","slug":"java%e6%8e%92%e5%ba%8f%e6%b1%87%e6%80%bb","status":"publish","type":"post","link":"https:\/\/ai.zhousir.top\/?p=556","title":{"rendered":"JAVA\u6392\u5e8f\u6c47\u603b"},"content":{"rendered":"
\n

\u4e0b\u9762\u6c47\u603b 8 \u79cd\u5e38\u7528\u6392\u5e8f\uff1a\u63d2\u5165\uff08\u76f4\u63a5\u63d2\u5165\u3001\u5e0c\u5c14\uff09\u3001\u4ea4\u6362\uff08\u5192\u6ce1\u3001\u5feb\u901f\uff09\u3001\u9009\u62e9\uff08\u76f4\u63a5\u9009\u62e9\u3001\u5806\uff09\u3001\u5f52\u5e76\u3001\u5206\u914d\uff08\u57fa\u6570\uff09\u3002\u8f85\u52a9\u7a7a\u95f4\u6700\u591a\u7684\u662f\u5f52\u5e76\uff0c\u6700\u5c11\u7684\u662f\u5806\uff1b\u5e73\u5747\u6700\u5feb\u7684\u662f\u5feb\u901f\u6392\u5e8f\u3002\u4e0d\u7a33\u5b9a\u7684\u4e09\u79cd\uff1a\u5feb\u901f\u3001\u5e0c\u5c14\u3001\u5806\u3002<\/p>\n

\u8d44\u6599\u7531\u7f51\u7edc\u6574\u7406\uff0c\u5982\u6709\u95ee\u9898\u6b22\u8fce\u6307\u6b63\u3002\u539f\u6587\uff1aJava\u5e38\u7528\u6392\u5e8f\u7b97\u6cd5\/\u7a0b\u5e8f\u5458\u5fc5\u987b\u638c\u63e1\u76848\u5927\u6392\u5e8f\u7b97\u6cd5<\/a> \uff1b\u53c2\u8003 java\u6392\u5e8f\u7b97\u6cd5\u603b\u7ed3<\/a>\u3002<\/p>\n

<\/p>\n

\"\"<\/a><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n
\u7b97\u6cd5<\/th>\n\u7c7b\u522b<\/th>\n\u7a33\u5b9a<\/th>\n\u8f85\u52a9\u7a7a\u95f4<\/th>\n\u5e73\u5747<\/th>\n<\/tr>\n<\/thead>\n
\u76f4\u63a5\u63d2\u5165<\/td>\n\u63d2\u5165<\/td>\n\u7a33\u5b9a<\/td>\nO(1)<\/td>\nO(n\u00b2)<\/td>\n<\/tr>\n
\u5e0c\u5c14<\/td>\n\u63d2\u5165<\/td>\n\u4e0d\u7a33\u5b9a<\/td>\nO(1)<\/td>\n\u89c6\u589e\u91cf\uff0c\u4f18\u4e8e\u63d2\u5165<\/td>\n<\/tr>\n
\u7b80\u5355\u9009\u62e9<\/td>\n\u9009\u62e9<\/td>\n\u4e0d\u7a33\u5b9a*<\/td>\nO(1)<\/td>\nO(n\u00b2)<\/td>\n<\/tr>\n
\u5806\u6392\u5e8f<\/td>\n\u9009\u62e9<\/td>\n\u4e0d\u7a33\u5b9a<\/td>\nO(1) \u6700\u5c11<\/td>\nO(n log n)<\/td>\n<\/tr>\n
\u5192\u6ce1<\/td>\n\u4ea4\u6362<\/td>\n\u7a33\u5b9a<\/td>\nO(1)<\/td>\nO(n\u00b2)<\/td>\n<\/tr>\n
\u5feb\u901f<\/td>\n\u4ea4\u6362<\/td>\n\u4e0d\u7a33\u5b9a<\/td>\nO(log n) \u9012\u5f52\u6808<\/td>\n\u5e73\u5747\u6700\u5feb O(n log n)<\/td>\n<\/tr>\n
\u5f52\u5e76<\/td>\n\u5f52\u5e76<\/td>\n\u7a33\u5b9a<\/td>\nO(n) \u6700\u591a<\/td>\nO(n log n)<\/td>\n<\/tr>\n
\u57fa\u6570<\/td>\n\u5206\u914d<\/td>\n\u7a33\u5b9a<\/td>\nO(n+k) \u6876<\/td>\nO(d\u00b7(n+k))<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u516b\u79cd\u6392\u5e8f\u4e4b\u95f4\u7684\u5173\u7cfb\uff1a<\/p>\n

\"\"<\/p>\n

\u4e00\u3001\u76f4\u63a5\u63d2\u5165\u6392\u5e8f<\/h2>\n

\u57fa\u672c\u601d\u60f3\uff1a\u524d\u9762 n\u22121 \u4e2a\u6570\uff08n\u22652\uff09\u5df2\u7ecf\u6709\u5e8f\uff0c\u628a\u7b2c n \u4e2a\u6570\u63d2\u8fdb\u8fd9\u6bb5\u6709\u5e8f\u533a\uff0c\u4f7f\u8fd9 n \u4e2a\u6570\u4e5f\u6709\u5e8f\u3002\u53cd\u590d\u76f4\u5230\u5168\u90e8\u6392\u5b8c\u3002<\/p>\n

\u5b9e\u4f8b\uff1a<\/p>\n

\"\"<\/p>\n

Java \u5b9e\u73b0\uff1a<\/p>\n

public class insertSort {  \n\npublic void insertSort(){\n    inta[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};\n    int temp=0;\n    for(int i=1;i<a.length;i++){\n       int j=i-1;\n       temp=a[i];\n       for(;j>=0&&temp<a[j];j--){\n           a[j+1]=a[j];  \/\/\u5c06\u5927\u4e8etemp\u7684\u503c\u6574\u4f53\u540e\u79fb\u4e00\u4e2a\u5355\u4f4d\n       }\n       a[j+1]=temp;\n    }  \n\n    for(int i=0;i<a.length;i++){\n       System.out.println(a[i]);\n    }\n}<\/code><\/pre>\n
\u4e8c\u3001\u5e0c\u5c14\u6392\u5e8f\uff08\u6700\u5c0f\u589e\u91cf\u6392\u5e8f\uff09<\/h2>\n
\u5148\u6309\u589e\u91cf d\uff08\u5e38\u89c1 n\/2\uff09\u5206\u7ec4\uff0c\u6bcf\u7ec4\u4e0b\u6807\u76f8\u5dee d\uff0c\u7ec4\u5185\u505a\u76f4\u63a5\u63d2\u5165\uff1b\u518d\u628a\u589e\u91cf\u7f29\u6210 d\/2 \u5206\u7ec4\u518d\u63d2\u3002\u76f4\u5230\u589e\u91cf\u53d8\u6210 1\uff0c\u518d\u505a\u4e00\u6b21\u76f4\u63a5\u63d2\u5165\uff0c\u6392\u5e8f\u5b8c\u6210\u3002<\/p>\n
\u5b9e\u4f8b\uff1a<\/p>\n
\"\"<\/p>\n
Java \u5b9e\u73b0\uff1a<\/p>\n
public class shellSort {  \n\npublic void shellSort(){  \n\n    int a[]={1,54,6,3,78,34,12,45,56,100};\n    double d1=a.length;\n    int temp=0;  \n\n    while(true){\n       d1= Math.ceil(d1\/2);\n       int d=(int) d1;\n       for(int x=0;x<d;x++){  \n\n           for(int i=x+d;i<a.length;i+=d){\n              int j=i-d;\n              temp=a[i];\n              for(;j>=0&&temp<a[j];j-=d){\n                   a[j+d]=a[j];\n              }\n              a[j+d]=temp;\n           }\n       }  \n\n       if(d==1){\n           break;\n       }  \n\n    for(int i=0;i<a.length;i++){\n       System.out.println(a[i]);\n    }\n}<\/code><\/pre>\n
\u4e09\u3001\u7b80\u5355\u9009\u62e9\u6392\u5e8f<\/h2>\n
\u9009\u51fa\u6700\u5c0f\u7684\u4e0e\u7b2c\u4e00\u4e2a\u4f4d\u7f6e\u4ea4\u6362\uff1b\u518d\u5728\u5269\u4e0b\u7684\u6570\u91cc\u627e\u6700\u5c0f\u7684\u4e0e\u7b2c\u4e8c\u4e2a\u4f4d\u7f6e\u4ea4\u6362\uff0c\u76f4\u5230\u5012\u6570\u7b2c\u4e8c\u4e2a\u548c\u6700\u540e\u4e00\u4e2a\u6bd4\u8f83\u5b8c\u3002<\/p>\n
\u5b9e\u4f8b\uff1a<\/p>\n
\"\"<\/p>\n
Java \u5b9e\u73b0\uff1a<\/p>\n
public class selectSort {  \n\n    public void selectSort(){\n       int a[]={1,54,6,3,78,34,12,45};\n       int position=0;\n       for(int i=0;i<a.length;i++){\n           int j=i+1;\n           position=i;\n           int temp=a[i];\n           for(;j<a.length;j++){\n              if(a[j]<temp){\n                 temp=a[j];\n                 position=j;\n              }\n           }\n           a[position]=a[i];\n           a[i]=temp;\n       }  \n\n       for(int i=0;i<a.length;i++)\n           System.out.println(a[i]);\n    }\n}<\/code><\/pre>\n
\u56db\u3001\u5806\u6392\u5e8f<\/h2>\n
\u5806\u6392\u5e8f\u662f\u6811\u5f62\u9009\u62e9\u6392\u5e8f\uff0c\u662f\u5bf9\u76f4\u63a5\u9009\u62e9\u7684\u6539\u8fdb\u3002\u5177\u6709 n \u4e2a\u5143\u7d20\u7684\u5e8f\u5217 (h1,h2,\u2026,hn)\uff0c\u5f53\u4e14\u4ec5\u5f53\u6ee1\u8db3 (hi\u2265h2i \u4e14 hi\u2265h2i+1) \u6216 (hi\u2264h2i \u4e14 hi\u2264h2i+1)\uff08i=1\u2026n\/2\uff09\u65f6\u79f0\u4e3a\u5806\u3002\u8fd9\u91cc\u53ea\u8ba8\u8bba\u524d\u8005\uff08\u5927\u9876\u5806\uff09\uff1a\u5806\u9876\u5fc5\u662f\u6700\u5927\u9879\u3002\u5b8c\u5168\u4e8c\u53c9\u6811\u80fd\u76f4\u89c2\u8868\u793a\u5806\uff1a\u6839\u662f\u5806\u9876\uff0c\u5176\u4f59\u4e3a\u5de6\u53f3\u5b50\u6811\u3002<\/p>\n
\u8d77\u521d\u628a\u5f85\u6392\u5e8f\u5217\u770b\u6210\u987a\u5e8f\u5b58\u50a8\u7684\u4e8c\u53c9\u6811\uff0c\u8c03\u6574\u6210\u5806\uff0c\u6839\u6700\u5927\uff1b\u628a\u6839\u4e0e\u6700\u540e\u4e00\u4e2a\u7ed3\u70b9\u4ea4\u6362\uff0c\u518d\u5bf9\u524d\u9762 n\u22121 \u4e2a\u6570\u91cd\u5efa\u5806\u3002\u76f4\u5230\u53ea\u5269\u4e24\u4e2a\u7ed3\u70b9\u4e5f\u4ea4\u6362\u3002\u6240\u4ee5\u5806\u6392\u5e8f\u9700\u8981\u4e24\u4e2a\u8fc7\u7a0b\uff1a\u5efa\u5806\uff0c\u4ee5\u53ca\u5806\u9876\u4e0e\u672b\u5143\u4ea4\u6362\u3002\u5bf9\u5e94\u4e24\u4e2a\u51fd\u6570\uff1a\u6e17\u900f\u5efa\u5806\uff0c\u53cd\u590d\u8c03\u7528\u5b8c\u6210\u6392\u5e8f\u3002<\/p>\n
\u5b9e\u4f8b\u3002\u521d\u59cb\u5e8f\u5217\uff1a46,79,56,38,40,84\u3002\u5efa\u5806\uff1a<\/p>\n
\"\"<\/p>\n
\u4ea4\u6362\uff0c\u4ece\u5806\u4e2d\u8e22\u51fa\u6700\u5927\u6570\uff1a<\/p>\n
\"\"<\/p>\n
\u5269\u4f59\u7ed3\u70b9\u518d\u5efa\u5806\uff0c\u518d\u4ea4\u6362\u8e22\u51fa\u6700\u5927\u6570\uff1a<\/p>\n
\"\"<\/p>\n
\u4f9d\u6b21\u7c7b\u63a8\uff1a\u6700\u540e\u5269\u4e24\u4e2a\u7ed3\u70b9\u4ea4\u6362\uff0c\u8e22\u51fa\u4e00\u4e2a\uff0c\u6392\u5e8f\u5b8c\u6210\u3002<\/p>\n
Java \u5b9e\u73b0\uff1a<\/p>\n
import java.util.Arrays;  \n\npublicclass HeapSort {\n    inta[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};\n    public  HeapSort(){\n       heapSort(a);\n    }  \n\n    public  void heapSort(int[] a){\n        System.out.println(\"\u5f00\u59cb\u6392\u5e8f\");\n        int arrayLength=a.length;\n        \/\/\u5faa\u73af\u5efa\u5806\n        for(int i=0;i<arrayLength-1;i++){\n            \/\/\u5efa\u5806\n            buildMaxHeap(a,arrayLength-1-i);\n            \/\/\u4ea4\u6362\u5806\u9876\u548c\u6700\u540e\u4e00\u4e2a\u5143\u7d20\n            swap(a,0,arrayLength-1-i);\n            System.out.println(Arrays.toString(a));\n        }\n    }  \n\n    private  void swap(int[] data, int i, int j) {\n        \/\/ TODO Auto-generated method stub\n        int tmp=data[i];\n        data[i]=data[j];\n        data[j]=tmp;\n    }  \n\n    \/\/\u5bf9data\u6570\u7ec4\u4ece0\u5230lastIndex\u5efa\u5927\u9876\u5806\n    privatevoid buildMaxHeap(int[] data, int lastIndex) {\n        \/\/ TODO Auto-generated method stub\n        \/\/\u4ecelastIndex\u5904\u8282\u70b9\uff08\u6700\u540e\u4e00\u4e2a\u8282\u70b9\uff09\u7684\u7236\u8282\u70b9\u5f00\u59cb  \n\n        for(int i=(lastIndex-1)\/2;i>=0;i--){\n            \/\/k\u4fdd\u5b58\u6b63\u5728\u5224\u65ad\u7684\u8282\u70b9\n            int k=i;\n            \/\/\u5982\u679c\u5f53\u524dk\u8282\u70b9\u7684\u5b50\u8282\u70b9\u5b58\u5728\n            while(k*2+1<=lastIndex){\n                \/\/k\u8282\u70b9\u7684\u5de6\u5b50\u8282\u70b9\u7684\u7d22\u5f15\n                int biggerIndex=2*k+1;\n                \/\/\u5982\u679cbiggerIndex\u5c0f\u4e8elastIndex\uff0c\u5373biggerIndex+1\u4ee3\u8868\u7684k\u8282\u70b9\u7684\u53f3\u5b50\u8282\u70b9\u5b58\u5728\n                if(biggerIndex<lastIndex){\n                    \/\/\u82e5\u679c\u53f3\u5b50\u8282\u70b9\u7684\u503c\u8f83\u5927\n                    if(data[biggerIndex]<data[biggerIndex+1]){\n                        \/\/biggerIndex\u603b\u662f\u8bb0\u5f55\u8f83\u5927\u5b50\u8282\u70b9\u7684\u7d22\u5f15\n                        biggerIndex++;\n                    }\n                }  \n\n                \/\/\u5982\u679ck\u8282\u70b9\u7684\u503c\u5c0f\u4e8e\u5176\u8f83\u5927\u7684\u5b50\u8282\u70b9\u7684\u503c\n               if(data[k]<data[biggerIndex]){\n                    \/\/\u4ea4\u6362\u4ed6\u4eec\n                    swap(data,k,biggerIndex);\n                    \/\/\u5c06biggerIndex\u8d4b\u4e88k\uff0c\u5f00\u59cbwhile\u5faa\u73af\u7684\u4e0b\u4e00\u6b21\u5faa\u73af\uff0c\u91cd\u65b0\u4fdd\u8bc1k\u8282\u70b9\u7684\u503c\u5927\u4e8e\u5176\u5de6\u53f3\u5b50\u8282\u70b9\u7684\u503c\n                    k=biggerIndex;\n                }else{\n                    break;\n                }\n            }\n        }\n    }\n}<\/code><\/pre>\n
\u4e94\u3001\u5192\u6ce1\u6392\u5e8f<\/h2>\n
\u5bf9\u5f53\u524d\u8fd8\u672a\u6392\u597d\u7684\u533a\u95f4\uff0c\u81ea\u4e0a\u800c\u4e0b\u6bd4\u8f83\u76f8\u90bb\u4e24\u4e2a\u6570\uff0c\u5927\u7684\u5f80\u4e0b\u6c89\u3001\u5c0f\u7684\u5f80\u4e0a\u5192\u3002\u4e00\u65e6\u53d1\u73b0\u76f8\u90bb\u4e24\u6570\u6b21\u5e8f\u4e0e\u8981\u6c42\u76f8\u53cd\uff0c\u5c31\u4e92\u6362\u3002<\/p>\n
\u5b9e\u4f8b\uff1a<\/p>\n
\"\"<\/p>\n
Java \u5b9e\u73b0\uff1a<\/p>\n
publicclass bubbleSort {  \n\npublicbubbleSort(){\n     inta[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};\n    int temp=0;\n    for(int i=0;i<a.length-1;i++){\n       for(int j=0;j<a.length-1-i;j++){\n         if(a[j]>a[j+1]){\n           temp=a[j];\n           a[j]=a[j+1];\n           a[j+1]=temp;\n         }\n       }\n    }  \n\n    for(int i=0;i<a.length;i++){\n       System.out.println(a[i]);\n   }\n}<\/code><\/pre>\n
\u516d\u3001\u5feb\u901f\u6392\u5e8f<\/h2>\n
\u9009\u4e00\u4e2a\u57fa\u51c6\uff08\u901a\u5e38\u7b2c\u4e00\u4e2a\u6216\u6700\u540e\u4e00\u4e2a\uff09\uff0c\u4e00\u8d9f\u626b\u63cf\u628a\u5e8f\u5217\u5206\u6210\u4e24\u90e8\u5206\uff1a\u6bd4\u57fa\u51c6\u5c0f\u7684\u3001\u5927\u4e8e\u7b49\u4e8e\u57fa\u51c6\u7684\u3002\u6b64\u65f6\u57fa\u51c6\u5df2\u5728\u6700\u7ec8\u4f4d\u7f6e\uff0c\u518d\u5bf9\u5de6\u53f3\u4e24\u6bb5\u9012\u5f52\u3002<\/p>\n
\u5b9e\u4f8b\uff1a<\/p>\n
\"\"<\/p>\n
Java \u5b9e\u73b0\uff1a<\/p>\n
public class quickSort {  \n\n  inta[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};\npublicquickSort(){\n    quick(a);\n    for(int i=0;i<a.length;i++){\n       System.out.println(a[i]);\n    }\n}\npublicint getMiddle(int[] list, int low, int high) {\n            int tmp =list[low];    \/\/\u6570\u7ec4\u7684\u7b2c\u4e00\u4e2a\u4f5c\u4e3a\u4e2d\u8f74\n            while (low < high){\n                while (low < high&& list[high] >= tmp) {\n                   high--;\n                }    \n\n                list[low] =list[high];   \/\/\u6bd4\u4e2d\u8f74\u5c0f\u7684\u8bb0\u5f55\u79fb\u5230\u4f4e\u7aef\n                while (low < high&& list[low] <= tmp) {\n                    low++;\n                }    \n\n                list[high] =list[low];   \/\/\u6bd4\u4e2d\u8f74\u5927\u7684\u8bb0\u5f55\u79fb\u5230\u9ad8\u7aef\n            }\n           list[low] = tmp;              \/\/\u4e2d\u8f74\u8bb0\u5f55\u5230\u5c3e\n            return low;                   \/\/\u8fd4\u56de\u4e2d\u8f74\u7684\u4f4d\u7f6e\n}   \n\npublicvoid _quickSort(int[] list, int low, int high) {\n            if (low < high){\n               int middle =getMiddle(list, low, high);  \/\/\u5c06list\u6570\u7ec4\u8fdb\u884c\u4e00\u5206\u4e3a\u4e8c\n               _quickSort(list, low, middle - 1);       \/\/\u5bf9\u4f4e\u5b57\u8868\u8fdb\u884c\u9012\u5f52\u6392\u5e8f\n               _quickSort(list,middle + 1, high);       \/\/\u5bf9\u9ad8\u5b57\u8868\u8fdb\u884c\u9012\u5f52\u6392\u5e8f\n            }\n}  \n\npublicvoid quick(int[] a2) {\n            if (a2.length > 0) {    \/\/\u67e5\u770b\u6570\u7ec4\u662f\u5426\u4e3a\u7a7a\n                _quickSort(a2,0, a2.length - 1);\n            }\n}\n}<\/code><\/pre>\n
\u4e03\u3001\u5f52\u5e76\u6392\u5e8f<\/h2>\n
\u628a\u4e24\u4e2a\uff08\u6216\u66f4\u591a\uff09\u6709\u5e8f\u8868\u5408\u5e76\u6210\u4e00\u4e2a\u65b0\u6709\u5e8f\u8868\uff1a\u5148\u628a\u5f85\u6392\u5e8f\u5217\u5206\u6210\u82e5\u5e72\u6709\u5e8f\u5b50\u5e8f\u5217\uff0c\u518d\u5408\u5e76\u6210\u6574\u4f53\u6709\u5e8f\u3002<\/p>\n
\u5b9e\u4f8b\uff1a<\/p>\n
\"\"<\/p>\n
Java \u5b9e\u73b0\uff1a<\/p>\n
import java.util.Arrays;  \n\npublicclass mergingSort {  \n\ninta[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};  \n\npublicmergingSort(){\n    sort(a,0,a.length-1);\n    for(int i=0;i<a.length;i++)\n       System.out.println(a[i]);\n}  \n\npublicvoid sort(int[] data, int left, int right) {\n    \/\/ TODO Auto-generatedmethod stub\n    if(left<right){\n        \/\/\u627e\u51fa\u4e2d\u95f4\u7d22\u5f15\n        int center=(left+right)\/2;\n        \/\/\u5bf9\u5de6\u8fb9\u6570\u7ec4\u8fdb\u884c\u9012\u5f52\n        sort(data,left,center);\n        \/\/\u5bf9\u53f3\u8fb9\u6570\u7ec4\u8fdb\u884c\u9012\u5f52\n        sort(data,center+1,right);\n        \/\/\u5408\u5e76\n        merge(data,left,center,right);\n    }  \n\n}  \n\npublicvoid merge(int[] data, int left, int center, int right) {\n    \/\/ TODO Auto-generatedmethod stub\n    int [] tmpArr=newint[data.length];\n    int mid=center+1;\n    \/\/third\u8bb0\u5f55\u4e2d\u95f4\u6570\u7ec4\u7684\u7d22\u5f15\n    int third=left;\n    int tmp=left;\n    while(left<=center&&mid<=right){\n        \/\/\u4ece\u4e24\u4e2a\u6570\u7ec4\u4e2d\u53d6\u51fa\u6700\u5c0f\u7684\u653e\u5165\u4e2d\u95f4\u6570\u7ec4\n        if(data[left]<=data[mid]){\n            tmpArr[third++]=data[left++];\n        }else{\n            tmpArr[third++]=data[mid++];\n        }  \n\n    }  \n\n    \/\/\u5269\u4f59\u90e8\u5206\u4f9d\u6b21\u653e\u5165\u4e2d\u95f4\u6570\u7ec4\n    while(mid<=right){\n        tmpArr[third++]=data[mid++];\n    }  \n\n    while(left<=center){\n        tmpArr[third++]=data[left++];\n    }  \n\n    \/\/\u5c06\u4e2d\u95f4\u6570\u7ec4\u4e2d\u7684\u5185\u5bb9\u590d\u5236\u56de\u539f\u6570\u7ec4\n    while(tmp<=right){\n        data[tmp]=tmpArr[tmp++];\n    }\n    System.out.println(Arrays.toString(data));\n}\n}<\/code><\/pre>\n
\u516b\u3001\u57fa\u6570\u6392\u5e8f<\/h2>\n
\u628a\u6240\u6709\u5f85\u6bd4\u8f83\u7684\u6b63\u6574\u6570\u7edf\u4e00\u6210\u540c\u6837\u7684\u6570\u4f4d\u957f\u5ea6\uff0c\u77ed\u7684\u524d\u9762\u8865\u96f6\u3002\u4ece\u6700\u4f4e\u4f4d\u5f00\u59cb\uff0c\u4f9d\u6b21\u505a\u4e00\u6b21\u7a33\u5b9a\u5206\u914d\uff1b\u4ece\u6700\u4f4e\u4f4d\u6392\u5230\u6700\u9ad8\u4f4d\uff0c\u5e8f\u5217\u5c31\u6709\u5e8f\u4e86\u3002<\/p>\n
\u5b9e\u4f8b\uff1a<\/p>\n
\"\"<\/p>\n
Java \u5b9e\u73b0\uff1a<\/p>\n
import java.util.ArrayList;\nimport java.util.List;  \n\npublic class radixSort {\n    inta[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,101,56,17,18,23,34,15,35,25,53,51};\n    public radixSort(){\n       sort(a);\n       for(inti=0;i<a.length;i++){\n              System.out.println(a[i]);\n       }\n    }\n    public  void sort(int[] array){\n       \/\/\u9996\u5148\u786e\u5b9a\u6392\u5e8f\u7684\u8d9f\u6570;\n       int max=array[0];\n       for(inti=1;i<array.length;i++){\n            if(array[i]>max){\n              max=array[i];\n            }\n       }\n       int time=0;\n       \/\/\u5224\u65ad\u4f4d\u6570;\n       while(max>0){\n          max\/=10;\n           time++;\n       }    \n\n        \/\/\u5efa\u7acb10\u4e2a\u961f\u5217;\n       List<ArrayList> queue=newArrayList<ArrayList>();\n       for(int i=0;i<10;i++){\n              ArrayList<Integer>queue1=new ArrayList<Integer>();\n           queue.add(queue1);\n       }    \n\n       \/\/\u8fdb\u884ctime\u6b21\u5206\u914d\u548c\u6536\u96c6;\n       for(int i=0;i<time;i++){\n           \/\/\u5206\u914d\u6570\u7ec4\u5143\u7d20;\n          for(intj=0;j<array.length;j++){\n               \/\/\u5f97\u5230\u6570\u5b57\u7684\u7b2ctime+1\u4f4d\u6570;\n                 int x=array[j]%(int)Math.pow(10,i+1)\/(int)Math.pow(10, i);\n                 ArrayList<Integer>queue2=queue.get(x);\n                 queue2.add(array[j]);\n                 queue.set(x, queue2);\n          }\n          int count=0;\/\/\u5143\u7d20\u8ba1\u6570\u5668;\n          \/\/\u6536\u96c6\u961f\u5217\u5143\u7d20;\n          for(int k=0;k<10;k++){\n               while(queue.get(k).size()>0){\n                   ArrayList<Integer>queue3=queue.get(k);\n                   array[count]=queue3.get(0);\n                   queue3.remove(0);\n                   count++;\n               }\n          }\n       }\n    }\n}<\/code><\/pre>\n
\n
\u4e00\u53e5\u8bdd\u603b\u7ed3\uff1a\u516b\u79cd\u6392\u5e8f\u5148\u5206\u6e05\u7a33\u5b9a\u6027\u548c\u989d\u5916\u7a7a\u95f4\uff1a\u8981\u7a33\u5b9a\u9009\u5f52\u5e76\u6216\u63d2\u5165\uff0c\u8981\u539f\u5730\u9009\u5806\uff0c\u5e73\u5747\u8981\u5feb\u9009\u5feb\u6392\u3002<\/strong><\/p>\n<\/blockquote>\n<\/section>\n","protected":false},"excerpt":{"rendered":"
\u4e0b\u9762\u6c47\u603b 8 \u79cd\u5e38\u7528\u6392\u5e8f\uff1a\u63d2\u5165\uff08\u76f4\u63a5\u63d2\u5165\u3001\u5e0c\u5c14\uff09\u3001\u4ea4\u6362\uff08\u5192\u6ce1\u3001\u5feb\u901f\uff09\u3001\u9009\u62e9\uff08\u76f4\u63a5\u9009\u62e9\u3001\u5806\uff09\u3001\u5f52\u5e76\u3001\u5206\u914d\uff08\u57fa\u6570\uff09 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[18],"tags":[177],"_links":{"self":[{"href":"https:\/\/ai.zhousir.top\/index.php?rest_route=\/wp\/v2\/posts\/556"}],"collection":[{"href":"https:\/\/ai.zhousir.top\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/ai.zhousir.top\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/ai.zhousir.top\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/ai.zhousir.top\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=556"}],"version-history":[{"count":3,"href":"https:\/\/ai.zhousir.top\/index.php?rest_route=\/wp\/v2\/posts\/556\/revisions"}],"predecessor-version":[{"id":3536,"href":"https:\/\/ai.zhousir.top\/index.php?rest_route=\/wp\/v2\/posts\/556\/revisions\/3536"}],"wp:attachment":[{"href":"https:\/\/ai.zhousir.top\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=556"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ai.zhousir.top\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=556"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ai.zhousir.top\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=556"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}