{"id":1964,"date":"2020-10-24T10:55:45","date_gmt":"2020-10-24T02:55:45","guid":{"rendered":"https:\/\/wyxxt.org.cn\/?p=1964"},"modified":"2023-12-04T15:19:57","modified_gmt":"2023-12-04T07:19:57","slug":"%e5%b8%b8%e8%a7%81%e6%8e%92%e5%ba%8f%e7%ae%97%e6%b3%95","status":"publish","type":"post","link":"https:\/\/wyxxt.org.cn\/?p=1964","title":{"rendered":"\u5e38\u89c1\u6392\u5e8f\u7b97\u6cd5"},"content":{"rendered":"\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\u4e2d\u6587\u540d\u79f0<\/th>\n\u82f1\u6587\u540d\u79f0<\/th>\n\u5e73\u5747\u65f6\u95f4\u590d\u6742\u5ea6<\/th>\n\u7a7a\u95f4\u590d\u6742\u5ea6<\/th>\n\u7a33\u5b9a\u6027<\/th>\n<\/tr>\n<\/thead>\n
\u9009\u62e9\u6392\u5e8f<\/td>\nSelection<\/td>\nn\u00b2<\/td>\n1<\/td>\n\u4e0d\u7a33<\/td>\n<\/tr>\n
\u5192\u6ce1\u6392\u5e8f<\/td>\nBubble<\/td>\nn\u00b2<\/td>\n1<\/td>\n\u7a33<\/td>\n<\/tr>\n
*\u63d2\u5165\u6392\u5e8f<\/strong><\/td>\nInsertion<\/td>\nn\u00b2<\/td>\n1<\/td>\n\u7a33<\/td>\n<\/tr>\n
*\u5806\u6392\u5e8f<\/strong><\/td>\nheap<\/td>\nnlogn<\/td>\n1<\/td>\n\u4e0d\u7a33<\/td>\n<\/tr>\n
\u5e0c\u5c14\u6392\u5e8f<\/td>\nShell<\/td>\nn^1.3<\/td>\n1<\/td>\n\u4e0d\u7a33<\/td>\n<\/tr>\n
*\u5f52\u5e76\u6392\u5e8f<\/strong><\/td>\nMerge<\/td>\nnlogn<\/td>\nn<\/td>\n\u7a33<\/td>\n<\/tr>\n
*\u5feb\u901f\u6392\u5e8f<\/strong><\/td>\nQuick<\/td>\nnlogn<\/td>\nlogn<\/td>\n\u4e0d\u7a33<\/td>\n<\/tr>\n
\u6876\u6392\u5e8f<\/td>\nBucket<\/td>\nn+k<\/td>\nn+k<\/td>\n\u7a33<\/td>\n<\/tr>\n
\u8ba1\u6570\u6392\u5e8f<\/td>\nCounting<\/td>\nn+k<\/td>\nn+k<\/td>\n\u7a33<\/td>\n<\/tr>\n
\u57fa\u6570\u6392\u5e8f<\/td>\nRadix<\/td>\nn*k<\/td>\nn+k<\/td>\n\u7a33<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

\u57fa\u4e8e\u6bd4\u8f83\u6392\u5e8f\uff0c\u65f6\u95f4\u590d\u6742\u5ea6\u7684\u6781\u9650\u662fO(N*logN)
\n\u8ffd\u6c42\u7a33\u5b9a\u6027\uff0c\u7528\u5f52\u5e76
\n\u8ffd\u6c42\u989d\u5916\u7a7a\u95f4\u590d\u6742\u5ea6\uff0c\u7528\u5806
\n\u8ffd\u6c42\u7edd\u5bf9\u7684\u901f\u5ea6\uff0c\u5feb\u6392\uff08\u5e38\u6570\u65f6\u95f4\u6700\u5c11\uff09<\/p>\n

\u5bf9\u6570\u5668<\/h3>\n
package cn.org.wyxxt;\n\nimport cn.org.wyxxt.sort.insertion.Insertion;\n\nimport java.util.Arrays;\n\npublic class DataChecker {\n    static int[] generateRandomArray(int maxSize, int maxValue) {\n        \/\/Math.random() [0,1)\n        int[] arr = new int[(int) ((maxSize + 1) * Math.random())];\n        for (int i = 0; i < arr.length; i++) {\n            \/\/ [-?,+?]\n            arr[i] = (int) ((maxValue + 1) * Math.random()) - (int) (maxValue * Math.random());\n        }\n        return arr;\n    }\n\n    static int[] copyArray(int[] arr) {\n        if (arr == null) {\n            return null;\n        }\n        int[] res = new int[arr.length];\n        for (int i = 0; i < arr.length; i++) {\n            res[i] = arr[i];\n        }\n        return res;\n    }\n\n    static void comparator(int[] arr) {\n        Arrays.sort(arr);\n    }\n\n    static boolean isEqual(int[] arr1, int[] arr2) {\n        if ((arr1 == null && arr2 != null) || (arr1 != null && arr2 == null)) {\n            return false;\n        }\n        if (arr1 == null && arr2 == null) {\n            return true;\n        }\n        if (arr1.length != arr2.length) {\n            return false;\n        }\n        for (int i = 0; i < arr1.length; i++) {\n            if (arr1[i] != arr2[i]) {\n                return false;\n            }\n        }\n        return true;\n    }\n\n    static void check() {\n        int testTime = 500000;\n        int maxSize = 100;\n        int maxValue = 100;\n        boolean same = true;\n        for (int times = 0; times < testTime; times++) {\n            int[] arr = generateRandomArray(maxSize, maxValue);\n            int[] arr2 = copyArray(arr);\n\n            comparator(arr);\n            Insertion.sort(arr2);\n\n\n            if (!isEqual(arr, arr2)) {\n                System.out.println(Arrays.toString(arr));\n                System.out.println(Arrays.toString(arr2));\n                same = false;\n                break;\n            }\n        }\n\n        System.out.println(same ? \"Nice!\" : \"Fucking fucked!\");\n    }\n\n    public static void main(String[] args) {\n        check();\n    }\n}\n\n\n<\/code><\/pre>\n
\u9009\u62e9\u6392\u5e8f<\/h3>\n
package cn.org.wyxxt.sort.selection;\n\npublic class Selection {\n\n    public static void main(String[] args) {\n        int[] arr = {1,4,8,2,9,0,3,6,5,7};\n        sort(arr);\n        print(arr);\n    }\n\n   public static void sort(int[] arr) {\n        for (int i=0;i<arr.length-1;i++) {\n            int minPos = i;\n\n            for (int j=i+1;j<arr.length;j++) {\n                minPos = arr[j]<arr[minPos] ? j : minPos;\n            }\n            swap(arr,i,minPos);\n        }\n    }\n\n    static void swap(int[] arr,int i,int j) {\n        int temp = arr[i];\n        arr[i] = arr[j];\n        arr[j] = temp;\n    }\n\n    static void print(int[] arr) {\n        for (int i=0;i<arr.length;i++) {\n            System.out.print(arr[i] + \" \");\n        }\n    }\n}\n\n\n<\/code><\/pre>\n
\u5192\u6ce1\u6392\u5e8f<\/h2>\n
package cn.org.wyxxt.sort.bubble;\n\npublic class Bubble {\n\n    public static void main(String[] args) {\n        int[] arr = {1,4,9,2,5,0,3,6,8,7};\n        sort(arr);\n        print(arr);\n    }\n\n    public static void sort(int[] arr) {\n        for(int j=arr.length-1;j>0;j--) {\n            findMax(arr, j);\n        }\n\n    }\n\n    static void findMax(int[] arr,int n) {\n        for (int i=0;i<n;i++) {\n            if (arr[i]>arr[i+1]) swap(arr,i,i+1);\n        }\n    }\n\n\n    static void swap(int[] arr,int i,int j) {\n        int temp = arr[i];\n        arr[i] = arr[j];\n        arr[j] = temp;\n    }\n\n    static void print(int[] arr) {\n        for (int i=0;i<arr.length;i++) {\n            System.out.print(arr[i] + \" \");\n        }\n    }\n}\n\n\n<\/code><\/pre>\n
\u63d2\u5165\u6392\u5e8f*<\/h2>\n
package cn.org.wyxxt.sort.insertion;\n\npublic class Insertion {\n    public static void main(String[] args) {\n        int[] arr = {8,6,3,9,5,1,7,4,2,0};\n        sort(arr);\n        print(arr);\n    }\n\n    public static void sort(int[] arr) {\n        for (int i=1;i<arr.length;i++) {\n            for (int j=i;j>0;j--) {\n                if (arr[j]<arr[j-1]) {\n                    swap(arr,j,j-1);\n                }\n            }\n        }\n    }\n\n    static void swap(int[] arr,int i,int j) {\n       int temp = arr[i];\n       arr[i] = arr[j];\n       arr[j] = temp;\n    }\n\n    static void print(int[] arr) {\n        for (int i=0;i<arr.length;i++) {\n            System.out.print(arr[i]+\" \");\n        }\n    }\n}\n\n\n<\/code><\/pre>\n
\u5e0c\u5c14\u6392\u5e8f<\/h3>\n
package cn.org.wyxxt.sort.shell;\n\npublic class Shell2 {\n\n    public static void main(String[] args) {\n        int[] arr = {9, 6, 3, 1, 4, 0, 8, 5, 2, 7};\n        sort(arr);\n        print(arr);\n    }\n\n    public static void sort(int[] arr) {\n        int h = 1;\n        while (h <= arr.length \/ 3) {\n            h = h * 3 + 1;\n        }\n\n        for (int gap = h; gap > 0; gap = (gap - 1) \/ 3) {\n            for (int i = gap; i < arr.length; i++) {\n                for (int j = i; j > gap - 1; j -= gap) {\n                    if (arr[j] < arr[j - gap]) {\n                        swap(arr, j, j - gap);\n                    }\n                }\n            }\n        }\n    }\n\n    static void swap(int[] arr, int i, int j) {\n        int temp = arr[i];\n        arr[i] = arr[j];\n        arr[j] = temp;\n    }\n\n    static void print(int[] arr) {\n        for (int i = 0; i < arr.length; i++) {\n            System.out.print(arr[i] + \" \");\n        }\n    }\n}\n\n\n\n<\/code><\/pre>\n
\u5f52\u5e76\u6392\u5e8f*<\/h2>\n
package cn.org.wyxxt.sort.merge;\n\npublic class Merge {\n\n    public static void main(String[] args) {\n        int[] arr = {1, 6, 0, 2, 7, 3, 9, 8, 5, 4};\n\/\/        int[] arr = {1, 4, 7, 8, 3, 6, 9};\n        sort(arr, 0, arr.length - 1);\n        print(arr);\n    }\n\n    public static void sort(int[] arr, int left, int right) {\n        if (left == right) return;\n        \/\/\u5206\u6210\u4e24\u534a\n        int mid = left + (right - left) \/ 2;\n        \/\/\u5de6\u8fb9\u6392\u5e8f\n        sort(arr, left, mid);\n        \/\/\u53f3\u8fb9\u6392\u5e8f\n        sort(arr, mid + 1, right);\n        merge(arr, left, mid + 1, right);\n    }\n\n    static void merge(int[] arr, int leftPtr, int rightPtr, int rightBound) {\n        int mid = rightPtr - 1;\n        int[] temp = new int[rightBound - leftPtr + 1];\n\n        int i = leftPtr;\n        int j = rightPtr;\n        int k = 0; \/\/temp\u7684\u7b2c\u4e00\u4e2a\u4f4d\u7f6e\n\n        while (i <= mid && j <= rightBound) {\n            temp[k++] = arr[i] <= arr[j] ? arr[i++] : arr[j++];\n\n            \/**\n             if (arr[i] <= arr[j]) { \/\/ <= \u7a33\u5b9a\u6027\u8003\u8651\n             temp[k++] = arr[i++];\n             } else {\n             temp[k++] = arr[j++];\n             }\n             *\/\n        }\n\n        while (i <= mid) temp[k++] = arr[i++];\n        while (j <= rightBound) temp[k++] = arr[j++];\n\n\/\/        print(temp);\n        for (int m = 0; m < temp.length; m++) arr[leftPtr + m] = temp[m];\n    }\n\n\n    static void print(int[] arr) {\n        for (int i = 0; i < arr.length; i++) {\n            System.out.print(arr[i] + \" \");\n        }\n    }\n}\n\n\n<\/code><\/pre>\n
\u5feb\u901f\u6392\u5e8f*<\/h2>\n
package cn.org.wyxxt.sort.quick;\n\npublic class Quick {\n    public static void main(String[] args) {\n        int[] arr = {7, 4, 1, 2, 8, 3, 9, 6, 5, 10};\n        sort(arr, 0, arr.length - 1);\n        print(arr);\n    }\n\n    public static void sort(int[] arr, int leftBound, int rightBound) {\n        if (leftBound >= rightBound) return;\n        int mid = partition(arr, leftBound, rightBound);\n        sort(arr, leftBound, mid - 1);\n        sort(arr, mid + 1, rightBound);\n    }\n\n    static int partition(int[] arr, int leftBound, int rightBound) {\n        int pivot = arr[rightBound];\n        int left = leftBound;\n        int right = rightBound - 1;\n\n        while (left <= right) {\n            while (left <= right && arr[left] <= pivot) left++;\n            while (left <= right && arr[right] >= pivot) right--;\n\/\/            System.out.println(pivot);\n\/\/            System.out.println(\"before swap:left->\" + left + \"right->\" + right);\n            if (left < right) swap(arr, left, right);\n\/\/            print(arr);\n\/\/            System.out.println();\n        }\n        swap(arr, left, rightBound);\n        return left;\n    }\n\n\n    static void swap(int[] arr, int i, int j) {\n        int temp = arr[i];\n        arr[i] = arr[j];\n        arr[j] = temp;\n    }\n\n    static void print(int[] arr) {\n        for (int i = 0; i < arr.length; i++) {\n            System.out.print(arr[i] + \" \");\n        }\n    }\n}\n\n\n<\/code><\/pre>\n
\u8ba1\u6570\u6392\u5e8f<\/h2>\n
package cn.org.wyxxt.sort.counting;\n\nimport java.util.Arrays;\n\npublic class Counting {\n\n    public static void main(String[] args) {\n        int[] arr = {2, 4, 2, 3, 7, 1, 1, 0, 0, 5, 6, 9, 8, 5, 7, 4, 0, 9, 1, 3, 7, 0, 6, 4, 6, 9, 8, 8, 7};\n        int[] result = sort(arr);\n        System.out.println(Arrays.toString(result));\n    }\n\n    public static int[] sort(int[] arr) {\n        int[] result = new int[arr.length];\n        int[] count = new int[10];\n        for (int i = 0; i < arr.length; i++) {\n            count[arr[i]]++;\n        }\n        System.out.println(Arrays.toString(count));\n\n        \/**\n         * \u4e0d\u7a33\u5b9a\u6392\u5e8f \u5bf9\u8c61\n         for (int i=0,j=0;i<count.length;i++) {\n         while(count[i]-- > 0) result[j++] = i;\n         }\n         *\/\n\n        for (int i = 1; i < count.length; i++) {\n            count[i] = count[i] + count[i - 1];\n        }\n        System.out.println(Arrays.toString(count));\n\n        for (int i = arr.length - 1; i >= 0; i--) {\n            result[--count[arr[i]]] = arr[i];\n        }\n        return result;\n    }\n}\n\n\n\n<\/code><\/pre>\n
\u57fa\u6570\u6392\u5e8f<\/h3>\n
package cn.org.wyxxt.sort.radix;\n\nimport java.util.Arrays;\n\npublic class Radix {\n    public static void main(String[] args) {\n        int[] arr = {421, 240, 115, 532, 305, 430, 124};\n        int[] result = sort(arr);\n        System.out.println(Arrays.toString(result));\n    }\n\n    public static int[] sort(int[] arr) {\n        int[] result = new int[arr.length];\n        int[] count = new int[10];\n\n        \/\/\u57fa\u6570\u6392\u5e8f\uff0c\u5206\u4e2a\u4f4d\u5341\u4f4d\u767e\u4f4d\u3002\u6bcf\u4e00\u4f4d\u6392\u5e8f\u90fd\u662f\u8ba1\u6570\u6392\u5e8f\n        for (int i = 0; i < 3; i++) {\n            \/\/\u4e2a\u4f4d\u6392\u5e8f\n            int division = (int) Math.pow(10, i);\n            for (int j = 0; j < arr.length; j++) {\n                int num = arr[j] \/ division % 10;\n                count[num]++;\n            }\n            for (int m = 1; m < count.length; m++) {\n                count[m] = count[m] + count[m - 1];\n            }\n            System.out.println(Arrays.toString(count));\n            for (int n = arr.length - 1; n >= 0; n--) {\n                int num = arr[n] \/ division % 10;\n                result[--count[num]] = arr[n];\n            }\n            System.arraycopy(result, 0, arr, 0, arr.length);\n            Arrays.fill(count, 0);\n        }\n        return result;\n    }\n\n}\n\n\n<\/code><\/pre>\n
\u5806\u6392\u5e8f*<\/h2>\n","protected":false},"excerpt":{"rendered":"
\u4e2d\u6587\u540d\u79f0 \u82f1\u6587\u540d\u79f0 \u5e73\u5747\u65f6\u95f4\u590d\u6742\u5ea6 \u7a7a\u95f4\u590d\u6742\u5ea6 \u7a33\u5b9a\u6027 \u9009\u62e9\u6392\u5e8f Selection n\u00b2 1 \u4e0d\u7a33 \u5192\u6ce1\u6392\u5e8f […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"default","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","ast-disable-related-posts":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"footnotes":""},"categories":[15],"tags":[400],"class_list":["post-1964","post","type-post","status-publish","format-standard","hentry","category-15","tag-400"],"_links":{"self":[{"href":"https:\/\/wyxxt.org.cn\/index.php?rest_route=\/wp\/v2\/posts\/1964","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wyxxt.org.cn\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wyxxt.org.cn\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wyxxt.org.cn\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/wyxxt.org.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1964"}],"version-history":[{"count":28,"href":"https:\/\/wyxxt.org.cn\/index.php?rest_route=\/wp\/v2\/posts\/1964\/revisions"}],"predecessor-version":[{"id":1995,"href":"https:\/\/wyxxt.org.cn\/index.php?rest_route=\/wp\/v2\/posts\/1964\/revisions\/1995"}],"wp:attachment":[{"href":"https:\/\/wyxxt.org.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1964"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wyxxt.org.cn\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1964"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wyxxt.org.cn\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1964"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}