java: Sorting Algorithms

 

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58

/**  * encoding: utf-8  * 版权所有 2024 ©涂聚文有限公司  * 许可信息查看：  * 描述：  * # Author    : geovindu,Geovin Du 涂聚文.  * # IDE       : IntelliJ IDEA 2023.1 Java 17  * # Datetime  : 2024 - 2024/5/20 - 14:43  * # User      : geovindu  * # Product   : IntelliJ IDEA  * # Project   : EssentialAlgorithms  * # File      : Person.java  * # explain   : 学习  类  **/   package Model;   /**  * 实体类  * 人  */ public class Person {       private int id;     private float salary;     private Object someBigObject = new Object();       /**      *      * @param id      * @param salary      */     public Person(int id, float salary)     {         this.id = id;         this.salary = salary;     }       /**      *      * @return      */     public float getSalary()     {         return salary;     }       @Override     public String toString()     {         return "Person{" +                 "id=" + id +                 ", salary=" + salary +                 ", someBigObject=" + someBigObject +                 '}';     }   }

　　

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40

/**  * encoding: utf-8  * 版权所有 2024 ©涂聚文有限公司  * 许可信息查看：  * 描述：  * # Author    : geovindu,Geovin Du 涂聚文.  * # IDE       : IntelliJ IDEA 2023.1 Java 17  * # Datetime  : 2024 - 2024/5/20 - 14:49  * # User      : geovindu  * # Product   : IntelliJ IDEA  * # Project   : EssentialAlgorithms  * # File      : Node.java  * # explain   : 学习  类  **/   package Model;   /**  * 实体类  * 节点  *  */ public class Node {       public int key;     public Node left, right;       /**      *      * @param item      */     public Node(int item)     {         key = item;         left = right = null;     }       }

　　

 

 

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581

/**  * encoding: utf-8  * 版权所有 2023 ©涂聚文有限公司  * 许可信息查看： https://www.geeksforgeeks.org/sorting-algorithms/  *  * 描述： https://www.programiz.com/dsa/insertion-sort  * # Author    : geovindu,Geovin Du 涂聚文. *  * # IDE       : IntelliJ IDEA 2023.1 Java 21  * # Datetime  : 2023 - 2023/9/28 - 9:55  * # User      : geovindu  * # Product   : IntelliJ IDEA  * # Project   : EssentialAlgorithms  * # File      : SortingAlgorithm.java  * # explain   : 学习  Sorting Algorithms 类  **/   package SortingAlgorithms; import java.lang.*; import java.util.*; import java.util.Arrays; import java.util.ArrayList; import java.util.Collections;   import Model.Person; import Model.Node;     public class SortingAlgorithm {           /**      *  1。Bubble Sort冒泡排序法      * @param array 整数数组      *      * */     public static void BubbleSort(int array[]) {           int size = array.length;           // loop to access each array element         for (int i = 0; i < size - 1; i++)               // loop to compare array elements             for (int j = 0; j < size - i - 1; j++)                   // compare two adjacent elements                 // change > to < to sort in descending order                 if (array[j] > array[j + 1]) {                       // swapping occurs if elements                     // are not in the intended order                     int temp = array[j];                     array[j] = array[j + 1];                     array[j + 1] = temp;                 }     }       /**      * 2 Selection Sort 选择排序      * @param array 整数数组      */     public static void SelectionSort(int array[]) {         int size = array.length;           for (int step = 0; step < size - 1; step++) {             int min_idx = step;               for (int i = step + 1; i < size; i++) {                   // To sort in descending order, change > to < in this line.                 // Select the minimum element in each loop.                 if (array[i] < array[min_idx]) {                     min_idx = i;                 }             }               // put min at the correct position             int temp = array[step];             array[step] = array[min_idx];             array[min_idx] = temp;         }      }      /**      * 3.Insertion Sort 插入排序      * @param array 整数数组      * */       public static void InsertionSort(int array[]) {         int size = array.length;           for (int step = 1; step < size; step++) {             int key = array[step];             int j = step - 1;               // Compare key with each element on the left of it until an element smaller than             // it is found.             // For descending order, change key<array[j] to key>array[j].             while (j >= 0 && key < array[j]) {                 array[j + 1] = array[j];                 --j;             }               // Place key at after the element just smaller than it.             array[j + 1] = key;         }       }       /**      *      * @param arr      * @param p      * @param q      * @param r      */      private static void merge(int arr[], int p, int q, int r) {           // Create L ← A[p..q] and M ← A[q+1..r]         int n1 = q - p + 1;         int n2 = r - q;           int L[] = new int[n1];         int M[] = new int[n2];           for (int i = 0; i < n1; i++)             L[i] = arr[p + i];         for (int j = 0; j < n2; j++)             M[j] = arr[q + 1 + j];           // Maintain current index of sub-arrays and main array         int i, j, k;         i = 0;         j = 0;         k = p;           // Until we reach either end of either L or M, pick larger among         // elements L and M and place them in the correct position at A[p..r]         while (i < n1 && j < n2) {             if (L[i] <= M[j]) {                 arr[k] = L[i];                 i++;             } else {                 arr[k] = M[j];                 j++;             }             k++;         }           // When we run out of elements in either L or M,         // pick up the remaining elements and put in A[p..r]         while (i < n1) {             arr[k] = L[i];             i++;             k++;         }           while (j < n2) {             arr[k] = M[j];             j++;             k++;         }     }       /**      * Divide the array into two subarrays, sort them and merge them      * 4 Merge Sort 合并/归并排序      * @param arr      * @param l      * @param r      */     public static  void mergeSort(int arr[], int l, int r) {         if (l < r) {               // m is the point where the array is divided into two subarrays             int m = (l + r) / 2;               mergeSort(arr, l, m);             mergeSort(arr, m + 1, r);               // Merge the sorted subarrays             merge(arr, l, m, r);         }     }       /**      * method to find the partition position      * @param array      * @param low      * @param high      * @return      */     static int partition(int array[], int low, int high) {           // choose the rightmost element as pivot         int pivot = array[high];           // pointer for greater element         int i = (low - 1);           // traverse through all elements         // compare each element with pivot         for (int j = low; j < high; j++) {             if (array[j] <= pivot) {                   // if element smaller than pivot is found                 // swap it with the greatr element pointed by i                 i++;                   // swapping element at i with element at j                 int temp = array[i];                 array[i] = array[j];                 array[j] = temp;             }           }           // swapt the pivot element with the greater element specified by i         int temp = array[i + 1];         array[i + 1] = array[high];         array[high] = temp;           // return the position from where partition is done         return (i + 1);     }       /**      * 5 Quick Sort 快速排序      * @param array 数组      * @param low 开始      * @param high 始束（长度）      */     public static void quickSort(int array[], int low, int high) {         if (low < high) {               // find pivot element such that             // elements smaller than pivot are on the left             // elements greater than pivot are on the right             int pi = partition(array, low, high);               // recursive call on the left of pivot             quickSort(array, low, pi - 1);               // recursive call on the right of pivot             quickSort(array, pi + 1, high);         }     }         /**      * 6 Counting Sort 计数排序      * @param array 数组      * @param size 长度      */     public static  void countSort(int array[], int size) {         int[] output = new int[size + 1];           // Find the largest element of the array         int max = array[0];         for (int i = 1; i < size; i++) {             if (array[i] > max)                 max = array[i];         }         int[] count = new int[max + 1];           // Initialize count array with all zeros.         for (int i = 0; i < max; ++i) {             count[i] = 0;         }           // Store the count of each element         for (int i = 0; i < size; i++) {             count[array[i]]++;         }           // Store the cummulative count of each array         for (int i = 1; i <= max; i++) {             count[i] += count[i - 1];         }           // Find the index of each element of the original array in count array, and         // place the elements in output array         for (int i = size - 1; i >= 0; i--) {             output[count[array[i]] - 1] = array[i];             count[array[i]]--;         }           // Copy the sorted elements into original array         for (int i = 0; i < size; i++) {             array[i] = output[i];         }     }       /**      *      * @param array      * @param size      * @param place      */     static void countingSort(int array[], int size, int place) {         int[] output = new int[size + 1];         int max = array[0];         for (int i = 1; i < size; i++) {             if (array[i] > max)                 max = array[i];         }         int[] count = new int[max + 1];           for (int i = 0; i < max; ++i)             count[i] = 0;           // Calculate count of elements         for (int i = 0; i < size; i++)             count[(array[i] / place) % 10]++;           // Calculate cumulative count         for (int i = 1; i < 10; i++)             count[i] += count[i - 1];           // Place the elements in sorted order         for (int i = size - 1; i >= 0; i--) {             output[count[(array[i] / place) % 10] - 1] = array[i];             count[(array[i] / place) % 10]--;         }           for (int i = 0; i < size; i++)             array[i] = output[i];     }       /**      * Function to get the largest element from an array      * @param array      * @param n      * @return      */     static int getMax(int array[], int n) {         int max = array[0];         for (int i = 1; i < n; i++)             if (array[i] > max)                 max = array[i];         return max;     }       /**      * Main function to implement radix sort      * 7 Radix Sort 基数排序      * @param array      * @param size      */     public static void radixSort(int array[], int size) {         // Get maximum element         int max = getMax(array, size);           // Apply counting sort to sort elements based on place value.         for (int place = 1; max / place > 0; place *= 10)             countingSort(array, size, place);     }       /**      * 8 Bucket Sort 桶排序      * @param arr      * @param n      */     public void bucketSort(float[] arr, int n) {         if (n <= 0)             return;         @SuppressWarnings("unchecked")         ArrayList<Float>[] bucket = new ArrayList[n];           // Create empty buckets         for (int i = 0; i < n; i++)             bucket[i] = new ArrayList<Float>();           // Add elements into the buckets         for (int i = 0; i < n; i++) {             int bucketIndex = (int) arr[i] * n;             bucket[bucketIndex].add(arr[i]);         }           // Sort the elements of each bucket         for (int i = 0; i < n; i++) {             Collections.sort((bucket[i]));         }           // Get the sorted array         int index = 0;         for (int i = 0; i < n; i++) {             for (int j = 0, size = bucket[i].size(); j < size; j++) {                 arr[index++] = bucket[i].get(j);             }         }     }       /**      *  9 Heap Sort 堆排序      * @param arr      */     public static void heapifySort(int arr[]) {         int n = arr.length;           // Build max heap         for (int i = n / 2 - 1; i >= 0; i--) {             heapify(arr, n, i);         }           // Heap sort         for (int i = n - 1; i >= 0; i--) {             int temp = arr[0];             arr[0] = arr[i];             arr[i] = temp;               // Heapify root element             heapify(arr, i, 0);         }     }       /**      *      * @param arr      * @param n      * @param i      */     static void heapify(int arr[], int n, int i) {         // Find largest among root, left child and right child         int largest = i;         int l = 2 * i + 1;         int r = 2 * i + 2;           if (l < n && arr[l] > arr[largest])             largest = l;           if (r < n && arr[r] > arr[largest])             largest = r;           // Swap and continue heapifying if root is not largest         if (largest != i) {             int swap = arr[i];             arr[i] = arr[largest];             arr[largest] = swap;               heapify(arr, n, largest);         }     }       /**      * 10 Shell Sort 希尔排序      * @param array      * @param n      */     public static void shellSort(int array[], int n) {           for (int interval = n / 2; interval > 0; interval /= 2) {             for (int i = interval; i < n; i += 1) {                 int temp = array[i];                 int j;                 for (j = i; j >= interval && array[j - interval] > temp; j -= interval) {                     array[j] = array[j - interval];                 }                 array[j] = temp;             }         }     }       /**      * 11 Linear Search线性搜索      * @param array      * @param x      * @return      */     public static int linearSearch(int array[], int x) {         int n = array.length;           // Going through array sequencially         for (int i = 0; i < n; i++) {             if (array[i] == x)                 return i;         }         return -1;     }       /**      * 12 Binary Search  二分查找      * @param array      * @param x      * @param low      * @param high      * @return      */     public  static int binarySearch(int array[], int x, int low, int high) {           // Repeat until the pointers low and high meet each other         while (low <= high) {             int mid = low + (high - low) / 2;               if (array[mid] == x)                 return mid;               if (array[mid] < x)                 low = mid + 1;               else                 high = mid - 1;         }           return -1;     }     static int bingo;     static int nextBingo;       /**      *      * @param vec      * @param n      */     private static void maxMin(int[] vec, int n)     {         for (int i = 1; i < n; i++) {             bingo = Math.min(bingo, vec[i]);             nextBingo = Math.max(nextBingo, vec[i]);         }     }       /**      * 13 Bingo Sort宾果排序      * @param vec      * @param n      * @return      */     public static int[] bingoSort(int[] vec, int n)     {         bingo = vec[0];         nextBingo = vec[0];         maxMin(vec, n);         int largestEle = nextBingo;         int nextElePos = 0;         while (bingo < nextBingo) {             // Will keep the track of the element position             // to             // shifted to their correct position             int startPos = nextElePos;             for (int i = startPos; i < n; i++) {                 if (vec[i] == bingo) {                     int temp = vec[i];                     vec[i] = vec[nextElePos];                     vec[nextElePos] = temp;                     nextElePos = nextElePos + 1;                 }                 // Here we are finding the next Bingo                 // Element for the next pass                 else if (vec[i] < nextBingo)                     nextBingo = vec[i];             }             bingo = nextBingo;             nextBingo = largestEle;         }         return vec;     }           static int MIN_MERGE = 32;       /**      *      * @param n      * @return      */     private static int minRunLength(int n)     {         assert n >= 0;           // Becomes 1 if any 1 bits are shifted off         int r = 0;         while (n >= MIN_MERGE) {             r |= (n & 1);             n >>= 1;         }         return n + r;     }       // This function sorts array from left index to     // to right index which is of size atmost RUN       /**      *      * @param arr      * @param left      * @param right      */     private static void insertionSort(int[] arr, int left,int right)     {         for (int i = left + 1; i <= right; i++) {             int temp = arr[i];             int j = i - 1;             while (j >= left && arr[j] > temp) {                 arr[j + 1] = arr[j];                 j--;             }             arr[j + 1] = temp;         }     }       // Merge function merges the sorted runs       /**      *      * @param arr      * @param l      * @param m      * @param r      */     public static void timMerge(int[] arr, int l, int m, int r)     {         // Original array is broken in two parts         // left and right array         int len1 = m - l + 1, len2 = r - m;         int[] left = new int[len1];         int[] right = new int[len2];         for (int x = 0; x < len1; x++) {             left[x] = arr[l + x];         }         for (int x = 0; x < len2; x++) {             right[x] = arr[m + 1 + x];         }           int i = 0;         int j = 0;         int k = l;           // After comparing, we merge those two array         // in larger sub array         while (i < len1 && j < len2) {             if (left[i] <= right[j]) {                 arr[k] = left[i];                 i++;             }             else {                 arr[k] = right[j];                 j++;             }             k++;         }           // Copy remaining elements         // of left, if any         while (i < len1) {             arr[k] = left[i];             k++;             i++;         }           // Copy remaining element         // of right, if any         while (j < len2) {             arr[k] = right[j];             k++;             j++;         }     }       // Iterative Timsort function to sort the     // array[0...n-1] (similar to merge sort)       /**      *  14 Tim Sort      * @param arr      * @param n      */     public static void timSort(int[] arr, int n)     {         int minRun = minRunLength(MIN_MERGE);           // Sort individual subarrays of size RUN         for (int i = 0; i < n; i += minRun) {             insertionSort(                     arr, i,                     Math.min((i + MIN_MERGE - 1), (n - 1)));         }           // Start merging from size         // RUN (or 32). It will         // merge to form size 64,         // then 128, 256 and so on         // ....         for (int size = minRun; size < n; size = 2 * size) {               // Pick starting point             // of left sub array. We             // are going to merge             // arr[left..left+size-1]             // and arr[left+size, left+2*size-1]             // After every merge, we             // increase left by 2*size             for (int left = 0; left < n; left += 2 * size) {                   // Find ending point of left sub array                 // mid+1 is starting point of right sub                 // array                 int mid = left + size - 1;                 int right = Math.min((left + 2 * size - 1),                         (n - 1));                   // Merge sub array arr[left.....mid] &                 // arr[mid+1....right]                 if (mid < right)                     timMerge(arr, left, mid, right);             }         }     }         // To find gap between elements     private static int getNextGap(int gap)     {         // Shrink gap by Shrink factor         gap = (gap*10)/13;         if (gap < 1)             return 1;         return gap;     }       // Function to sort arr[] using Comb Sort       /**      *15  Comb Sort      * @param arr      */     public static void comSort(int arr[])     {         int n = arr.length;           // initialize gap         int gap = n;           // Initialize swapped as true to make sure that         // loop runs         boolean swapped = true;           // Keep running while gap is more than 1 and last         // iteration caused a swap         while (gap != 1 || swapped == true)         {             // Find next gap             gap = getNextGap(gap);               // Initialize swapped as false so that we can             // check if swap happened or not             swapped = false;               // Compare all elements with current gap             for (int i=0; i<n-gap; i++)             {                 if (arr[i] > arr[i+gap])                 {                     // Swap arr[i] and arr[i+gap]                     int temp = arr[i];                     arr[i] = arr[i+gap];                     arr[i+gap] = temp;                       // Set swapped                     swapped = true;                 }             }         }     }       /**      * 16  Pigeonhole Sort 鸽巢排序      * @param arr      * @param n      */     public static void pigeonholeSort(int arr[],int n)     {         int min = arr[0];         int max = arr[0];         int range, i, j, index;         for(int a=0; a<n; a++)         {             if(arr[a] > max)                 max = arr[a];             if(arr[a] < min)                 min = arr[a];         }           range = max - min + 1;         int[] phole = new int[range];         Arrays.fill(phole, 0);           for(i = 0; i<n; i++)             phole[arr[i] - min]++;             index = 0;           for(j = 0; j<range; j++)             while(phole[j]-->0)                 arr[index++]=j+min;       }       // Function sort the array using Cycle sort       /**      * 17 Cycle Sort 循环排序      * @param arr      * @param n      */     public static void cycleSort(int arr[], int n)     {         // count number of memory writes         int writes = 0;           // traverse array elements and put it to on         // the right place         for (int cycle_start = 0; cycle_start <= n - 2; cycle_start++) {             // initialize item as starting point             int item = arr[cycle_start];               // Find position where we put the item. We basically             // count all smaller elements on right side of item.             int pos = cycle_start;             for (int i = cycle_start + 1; i < n; i++)                 if (arr[i] < item)                     pos++;               // If item is already in correct position             if (pos == cycle_start)                 continue;               // ignore all duplicate elements             while (item == arr[pos])                 pos += 1;               // put the item to it's right position             if (pos != cycle_start) {                 int temp = item;                 item = arr[pos];                 arr[pos] = temp;                 writes++;             }               // Rotate rest of the cycle             while (pos != cycle_start) {                 pos = cycle_start;                   // Find position where we put the element                 for (int i = cycle_start + 1; i < n; i++)                     if (arr[i] < item)                         pos += 1;                   // ignore all duplicate elements                 while (item == arr[pos])                     pos += 1;                   // put the item to it's right position                 if (item != arr[pos]) {                     int temp = item;                     item = arr[pos];                     arr[pos] = temp;                     writes++;                 }             }         }     }       /**      * 18 Cocktail Sort 鸡尾酒排序      * @param a      */     public static void cocktailSort(int a[])     {         boolean swapped = true;         int start = 0;         int end = a.length;           while (swapped == true)         {             // reset the swapped flag on entering the             // loop, because it might be true from a             // previous iteration.             swapped = false;               // loop from bottom to top same as             // the bubble sort             for (int i = start; i < end - 1; ++i)             {                 if (a[i] > a[i + 1]) {                     int temp = a[i];                     a[i] = a[i + 1];                     a[i + 1] = temp;                     swapped = true;                 }             }               // if nothing moved, then array is sorted.             if (swapped == false)                 break;               // otherwise, reset the swapped flag so that it             // can be used in the next stage             swapped = false;               // move the end point back by one, because             // item at the end is in its rightful spot             end = end - 1;               // from top to bottom, doing the             // same comparison as in the previous stage             for (int i = end - 1; i >= start; i--)             {                 if (a[i] > a[i + 1])                 {                     int temp = a[i];                     a[i] = a[i + 1];                     a[i + 1] = temp;                     swapped = true;                 }             }               // increase the starting point, because             // the last stage would have moved the next             // smallest number to its rightful spot.             start = start + 1;         }     }       // Define a helper function to merge two sorted lists       /**      *      * @param list1      * @param list2      * @return      */     private static List<Integer> mergeLists(List<Integer> list1, List<Integer> list2) {         List<Integer> result = new ArrayList<>();         while (!list1.isEmpty() && !list2.isEmpty()) {             if (list1.get(0) < list2.get(0)) {                 result.add(list1.remove(0));             } else {                 result.add(list2.remove(0));             }         }         result.addAll(list1);         result.addAll(list2);         return result;     }       // Recursive function to perform strand sort       /**      *  19 Strand Sort 经典排序      * @param inputList      * @return      */     public static List<Integer> strandSort(List<Integer> inputList) {         // Base case: if the input list has 1 or fewer elements, it's already sorted         if (inputList.size() <= 1) {             return inputList;         }           // Initialize a sublist with the first element of the input list         List<Integer> sublist = new ArrayList<>();         sublist.add(inputList.remove(0));           int i = 0;         while (i < inputList.size()) {             // If the current element in the input list is greater than             // the last element in the sublist,             // add it to the sublist; otherwise, continue to the next element in the input list.             if (inputList.get(i) > sublist.get(sublist.size() - 1)) {                 sublist.add(inputList.remove(i));             } else {                 i++;             }         }           // The sortedSublist contains the sorted elements from the current sublist         List<Integer> sortedSublist = new ArrayList<>(sublist);           // Recursively sort the remaining part of the input list         List<Integer> remainingList = strandSort(inputList);           // Merge the sorted sublist and the sorted remainingList         return mergeLists(sortedSublist, remainingList);     }       /* The parameter dir indicates the sorting direction,            ASCENDING or DESCENDING; if (a[i] > a[j]) agrees            with the direction, then a[i] and a[j] are            interchanged. */     private static void compAndSwap(int a[], int i, int j, int dir)     {         if ( (a[i] > a[j] && dir == 1) ||                 (a[i] < a[j] && dir == 0))         {             // Swapping elements             int temp = a[i];             a[i] = a[j];             a[j] = temp;         }     }       /* It recursively sorts a bitonic sequence in ascending        order, if dir = 1, and in descending order otherwise        (means dir=0). The sequence to be sorted starts at        index position low, the parameter cnt is the number        of elements to be sorted.*/     private static void bitonicMerge(int a[], int low, int cnt, int dir)     {         if (cnt>1)         {             int k = cnt/2;             for (int i=low; i<low+k; i++)                 compAndSwap(a,i, i+k, dir);             bitonicMerge(a,low, k, dir);             bitonicMerge(a,low+k, k, dir);         }     }       /* This function first produces a bitonic sequence by        recursively sorting its two halves in opposite sorting        orders, and then  calls bitonicMerge to make them in        the same order */     private static void getBitonicSort(int a[], int low, int cnt, int dir)     {         if (cnt>1)         {             int k = cnt/2;               // sort in ascending order since dir here is 1             getBitonicSort(a, low, k, 1);               // sort in descending order since dir here is 0             getBitonicSort(a,low+k, k, 0);               // Will merge whole sequence in ascending order             // since dir=1.             bitonicMerge(a, low, cnt, dir);         }     }       /*Caller of bitonicSort for sorting the entire array       of length N in ASCENDING order */       /**      * 20  Bitonic Sort 双调排序      * @param a      * @param N      * @param up      */     public static void BitonicSort(int a[], int N, int up)     {         getBitonicSort(a, 0, N, up);     }         /* Reverses arr[0..i] */       /**      *      * @param arr      * @param i      */      private static void flip(int arr[], int i)     {         int temp, start = 0;         while (start < i)         {             temp = arr[start];             arr[start] = arr[i];             arr[i] = temp;             start++;             i--;         }     }       // Returns index of the     // maximum element in     // arr[0..n-1]       /**      *      * @param arr      * @param n      * @return      */      private static int findMax(int arr[], int n)     {         int mi, i;         for (mi = 0, i = 0; i < n; ++i)             if (arr[i] > arr[mi])                 mi = i;         return mi;     }       // The main function that     // sorts given array using     // flip operations       /**      *  21 Pancake Sort 煎饼排序.      * @param arr      * @param n      * @return      */     public static int pancakeSort(int arr[], int n)     {         // Start from the complete         // array and one by one         // reduce current size by one         for (int curr_size = n; curr_size > 1;              --curr_size)         {             // Find index of the             // maximum element in             // arr[0..curr_size-1]             int mi = findMax(arr, curr_size);               // Move the maximum element             // to end of current array             // if it's not already at             // the end             if (mi != curr_size-1)             {                 // To move at the end,                 // first move maximum                 // number to beginning                 flip(arr, mi);                   // Now move the maximum                 // number to end by                 // reversing current array                 flip(arr, curr_size-1);             }         }         return 0;     }       // Sorts array a[0..n-1] using Bogo sort       /**      *  22 Bogo Sort  BogoSort or Permutation Sort 置换排序、愚蠢排序、慢排序、猎枪排序或猴子排序      * @param a      */     public static void bogoSort(int[] a)     {         // if array is not sorted then shuffle the         // array again         while (isSorted(a) == false)             shuffle(a);     }       // To generate permutation of the array       /**      *      * @param a      */     private static void shuffle(int[] a)     {         // Math.random() returns a double positive         // value, greater than or equal to 0.0 and         // less than 1.0.         for (int i = 1; i < a.length; i++)             bogoSwap(a, i, (int)(Math.random() * i));     }       // Swapping 2 elements       /**      *      * @param a      * @param i      * @param j      */      private static void bogoSwap(int[] a, int i, int j)     {         int temp = a[i];         a[i] = a[j];         a[j] = temp;     }       // To check if array is sorted or not       /**      *      * @param a      * @return      */      private static boolean isSorted(int[] a)     {         for (int i = 1; i < a.length; i++)             if (a[i] < a[i - 1])                 return false;         return true;     }       /**      * 23 Gnome Sort 地精排序,也称侏儒排序      * @param arr      * @param n      */     public static void gnomeSort(int arr[], int n)     {         int index = 0;           while (index < n) {             if (index == 0)                 index++;             if (arr[index] >= arr[index - 1])                 index++;             else {                 int temp = 0;                 temp = arr[index];                 arr[index] = arr[index - 1];                 arr[index - 1] = temp;                 index--;             }         }         return;     }       /**      * 24.Sleep Sort 睡眠排序      * @param arr      */     public static void sleepSort(ArrayList<Integer> arr) {         ArrayList<Thread> threads = new ArrayList<>();  // Create an ArrayList to hold threads           for (int num : arr) {             Thread thread = new Thread(() -> {                 try {                     Thread.sleep(num);  // Sleep for 'num' milliseconds                     System.out.print(num + " ");  // Print the number after sleeping                 } catch (InterruptedException e) {                     e.printStackTrace();                 }             });               threads.add(thread); // Add the thread to the ArrayList             thread.start(); // Start the thread         }           for (Thread thread : threads) {             try {                 thread.join(); // Wait for each thread to finish             } catch (InterruptedException e) {                 e.printStackTrace();             }         }     }       // Function to implement stooge sort       /**      *  25 Stooge Sort 臭皮匠排序      * @param arr      * @param l      * @param h      */      public static void stoogeSort(int arr[], int l, int h)     {         if (l >= h)             return;           // If first element is smaller         // than last, swap them         if (arr[l] > arr[h]) {             int t = arr[l];             arr[l] = arr[h];             arr[h] = t;         }           // If there are more than 2 elements in         // the array         if (h - l + 1 > 2) {             int t = (h - l + 1) / 3;               // Recursively sort first 2/3 elements             stoogeSort(arr, l, h - t);               // Recursively sort last 2/3 elements             stoogeSort(arr, l + t, h);               // Recursively sort first 2/3 elements             // again to confirm             stoogeSort(arr, l, h - t);         }     }         // Modifying tag array so that we can access     // persons in sorted order of salary.       /**      * 26 Tag Sort (To get both sorted and original)      * @param persons      * @param tag      */     public static void tagSort(Person persons[],int tag[])     {         int n = persons.length;         for (int i=0; i<n; i++)         {             for (int j=i+1; j<n; j++)             {                 if (persons[tag[i]].getSalary() >                         persons[tag[j]].getSalary())                 {                     // Note we are not sorting the                     // actual Persons array, but only                     // the tag array                     int temp = tag[i];                     tag[i] = tag[j];                     tag[j] = temp;                 }             }         }     }         public static Node root;     // This method mainly     // calls insertRec()       /**      *      * @param key      */     private static void treeInsert(int key)     {         root = insertRec(root, key);     }       /* A recursive function to     insert a new key in BST */       /**      *      * @param root      * @param key      * @return      */     private static Node insertRec(Node root, int key)     {           /* If the tree is empty,         return a new node */         if (root == null)         {             root = new Node(key);             return root;         }           /* Otherwise, recur         down the tree */         if (key < root.key)             root.left = insertRec(root.left, key);         else if (key > root.key)             root.right = insertRec(root.right, key);           /* return the root */         return root;     }       // A function to do     // inorder traversal of BST       /**      *27 Tree Sort      * @param root      */     public static void inorderRec(Node root)     {         if (root != null)         {             inorderRec(root.left);             System.out.print(root.key + " ");             inorderRec(root.right);         }     }       /**      *      * @param arr      */     public static void treeins(int arr[])     {         for(int i = 0; i < arr.length; i++)         {             treeInsert(arr[i]);         }       }       /**      *  28.Brick Sort / Odd-Even Sort 砖排序算法（Brick Sort），也被称为奇偶排序（Odd-Even Sort）      * @param arr      * @param n      */     public static void oddEvenSort(int arr[], int n)     {         boolean isSorted = false; // Initially array is unsorted           while (!isSorted)         {             isSorted = true;             int temp =0;               // Perform Bubble sort on odd indexed element             for (int i=1; i<=n-2; i=i+2)             {                 if (arr[i] > arr[i+1])                 {                     temp = arr[i];                     arr[i] = arr[i+1];                     arr[i+1] = temp;                     isSorted = false;                 }             }               // Perform Bubble sort on even indexed element             for (int i=0; i<=n-2; i=i+2)             {                 if (arr[i] > arr[i+1])                 {                     temp = arr[i];                     arr[i] = arr[i+1];                     arr[i+1] = temp;                     isSorted = false;                 }             }         }           return;     }         // Function  for 3-way merge sort process       /**      * 29.3-way Merge Sort      * @param gArray      */     public static void mergeSort3Way(Integer[] gArray)     {         // if array of size is zero returns null         if (gArray == null)             return;           // creating duplicate of given array         Integer[] fArray = new Integer[gArray.length];           // copying elements of given array into         // duplicate array         for (int i = 0; i < fArray.length; i++)             fArray[i] = gArray[i];           // sort function         mergeSort3WayRec(fArray, 0, gArray.length, gArray);           // copy back elements of duplicate array         // to given array         for (int i = 0; i < fArray.length; i++)             gArray[i] = fArray[i];     }       /* Performing the merge sort algorithm on the        given array of values in the rangeof indices        [low, high).  low is minimum index, high is        maximum index (exclusive) */       /**      *      * @param gArray      * @param low      * @param high      * @param destArray      */     public static void mergeSort3WayRec(Integer[] gArray,int low, int high, Integer[] destArray)     {         // If array size is 1 then do nothing         if (high - low < 2)             return;           // Splitting array into 3 parts         int mid1 = low + ((high - low) / 3);         int mid2 = low + 2 * ((high - low) / 3) + 1;           // Sorting 3 arrays recursively         mergeSort3WayRec(destArray, low, mid1, gArray);         mergeSort3WayRec(destArray, mid1, mid2, gArray);         mergeSort3WayRec(destArray, mid2, high, gArray);           // Merging the sorted arrays         WayMerge(destArray, low, mid1, mid2, high, gArray);     }       /* Merge the sorted ranges [low, mid1), [mid1,        mid2) and [mid2, high) mid1 is first midpoint        index in overall range to merge mid2 is second        midpoint index in overall range to merge*/       /**      *      * @param gArray      * @param low      * @param mid1      * @param mid2      * @param high      * @param destArray      */     public static void WayMerge(Integer[] gArray, int low,int mid1, int mid2, int high,Integer[] destArray)     {         int i = low, j = mid1, k = mid2, l = low;           // choose smaller of the smallest in the three ranges         while ((i < mid1) && (j < mid2) && (k < high))         {             if (gArray[i].compareTo(gArray[j]) < 0)             {                 if (gArray[i].compareTo(gArray[k]) < 0)                     destArray[l++] = gArray[i++];                   else                     destArray[l++] = gArray[k++];             }             else             {                 if (gArray[j].compareTo(gArray[k]) < 0)                     destArray[l++] = gArray[j++];                 else                     destArray[l++] = gArray[k++];             }         }           // case where first and second ranges have         // remaining values         while ((i < mid1) && (j < mid2))         {             if (gArray[i].compareTo(gArray[j]) < 0)                 destArray[l++] = gArray[i++];             else                 destArray[l++] = gArray[j++];         }           // case where second and third ranges have         // remaining values         while ((j < mid2) && (k < high))         {             if (gArray[j].compareTo(gArray[k]) < 0)                 destArray[l++] = gArray[j++];               else                 destArray[l++] = gArray[k++];         }           // case where first and third ranges have         // remaining values         while ((i < mid1) && (k < high))         {             if (gArray[i].compareTo(gArray[k]) < 0)                 destArray[l++] = gArray[i++];             else                 destArray[l++] = gArray[k++];         }           // copy remaining values from the first range         while (i < mid1)             destArray[l++] = gArray[i++];           // copy remaining values from the second range         while (j < mid2)             destArray[l++] = gArray[j++];           // copy remaining values from the third range         while (k < high)             destArray[l++] = gArray[k++];     }     }

　　

 

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439

/**  * encoding: utf-8  * 版权所有 2023 ©涂聚文有限公司  * 许可信息查看：  * 描述：  * # Author    : geovindu,Geovin Du 涂聚文.  * # IDE       : IntelliJ IDEA 2023.1 Java 21  * # Datetime  : 2023 - 2023/9/28 - 10:00  * # User      : geovindu  * # Product   : IntelliJ IDEA  * # Project   : EssentialAlgorithms  * # File      : SortingExmaple.java  * # explain   : 学习  Sorting Algorithms 类  **/   package BLL;   import SortingAlgorithms.SortingAlgorithm; import java.util.Arrays; import java.util.ArrayList; import java.util.List; import Model.Person; import Model.Node;   public class SortingExmaple {           /**      *1.Bubble Sort冒泡排序      * */      public static void Bubble()     {         int[] geovindu = { -2, 45, 0, 11, -9 };            // call method using class name         SortingAlgorithms.SortingAlgorithm.BubbleSort(geovindu);           System.out.println("1.冒泡排序 Sort Bubble Sorted Array in Ascending Order:");         System.out.println(Arrays.toString(geovindu));       }       /**      * 2 Selection Sort 选择排序      */     public static  void Selection()     {         int[] geovindu = { 20, 12, 10, 15, 2 };         //SelectionSort ss = new SelectionSort();         SortingAlgorithms.SortingAlgorithm.SelectionSort(geovindu);         System.out.println("2.选择排序 Selection Sorted Array in Ascending Order: ");         System.out.println(Arrays.toString(geovindu));       }       /**      * 3. Insertion Sort 插入排序      * */     public  static void Insertion()     {           int[] geovindu = { 9, 5, 1, 4, 3 };         SortingAlgorithms.SortingAlgorithm.InsertionSort(geovindu);         System.out.println("3.插入排序 Insertion Sorted Array in Ascending Order: ");         System.out.println(Arrays.toString(geovindu));         }       /**      * 4 Merge Sort 合并/归并排序      */     public static  void mergeSort()     {         int arr[] = { 6, 5, 12, 10, 9, 1 };         SortingAlgorithms.SortingAlgorithm.mergeSort(arr, 0, arr.length - 1);         int n = arr.length;         for (int i = 0; i < n; ++i)             System.out.print(arr[i] + " ");         System.out.println();       }       /**      * 5 Quick Sort 快速排序      */     public  static void quicksort()     {           int[] data = { 8, 7, 2, 1, 0, 9, 6 };         System.out.println("Unsorted Array");         System.out.println(Arrays.toString(data));         int size = data.length;         // call quicksort() on array data         SortingAlgorithms.SortingAlgorithm.quickSort(data, 0, size - 1);         System.out.println("Sorted Array in Ascending Order: ");         System.out.println(Arrays.toString(data));       }       /**      * 6 Counting Sort 计数排序      */     public  static void countSort()     {           int[] data = { 4, 2, 2, 8, 3, 3, 1 };         int size = data.length;         SortingAlgorithms.SortingAlgorithm.countSort(data, size);         System.out.println("Sorted Array in Ascending Order: ");         System.out.println(Arrays.toString(data));     }       /**      * 7 Radix Sort 基数排序      */     public static void radixSort()     {         int[] data = { 121, 432, 564, 23, 1, 45, 788 };         int size = data.length;         SortingAlgorithms.SortingAlgorithm.radixSort(data, size);         System.out.println("Sorted Array in Ascending Order: ");         System.out.println(Arrays.toString(data));         }       /**      * 9 Heap Sort 堆排序      */     public static void heapifySort()     {         int arr[] = { 1, 12, 9, 5, 6, 10 };         SortingAlgorithms.SortingAlgorithm.heapifySort(arr);         int n = arr.length;         for (int i = 0; i < n; ++i)             System.out.print(arr[i] + " ");         System.out.println();       }       /**      * 10 Shell Sort 希尔排序      */     public static void shellSort()     {         int[] data = { 9, 8, 3, 7, 5, 6, 4, 1 };         int size = data.length;         SortingAlgorithms.SortingAlgorithm.shellSort(data, size);         System.out.println("Sorted Array in Ascending Order: ");         System.out.println(Arrays.toString(data));     }       /**      * 12 Binary Search  二分查找      */     public  static  void binarySearch()     {           int array[] = { 3, 4, 5, 6, 7, 8, 9 };         int n = array.length;         int x = 4;         int result = SortingAlgorithms.SortingAlgorithm.binarySearch(array, x, 0, n - 1);         if (result == -1)             System.out.println("Not found");         else             System.out.println("Element found at index " + result);       }       /**      * 13 Bingo Sort宾果排序      */     public static  void binggoSor()     {         int[] arr = { 5, 4, 8, 5, 4, 8, 5, 4, 4, 4 };         arr = SortingAlgorithms.SortingAlgorithm.bingoSort(arr, arr.length);         int n=arr.length;         for (int i = 0; i < n; i++) {             System.out.print(arr[i] + " ");         }         System.out.println();     }       /**      *14 Tim Sort      */    public static void timSort()    {          int[] arr = { -2, 7,  15,  -14, 0, 15,  0, 7,                -7, -4, -13, 5,   8, -14, 12 };        int n = arr.length;        System.out.println("Given Array is");        SortingAlgorithms.SortingAlgorithm.timSort(arr, n);        System.out.println("After Sorting Array is");        for (int i = 0; i < n; i++) {            System.out.print(arr[i] + " ");        }        System.out.print("\n");    }       /**      * 15  Comb Sort      */    public  static void comSort()    {        int arr[] = {8, 4, 1, 56, 3, -44, 23, -6, 28, 0};        SortingAlgorithms.SortingAlgorithm.comSort(arr);        System.out.println("sorted array");        for (int i=0; i<arr.length; ++i)            System.out.print(arr[i] + " ");    }       /**      * 16  Pigeonhole Sort 鸽巢排序      */    public  static  void pigeonholeSort()    {        int[] arr = {8, 3, 2, 7, 4, 6, 8};        System.out.print("Sorted order is : ");        SortingAlgorithms.SortingAlgorithm.pigeonholeSort(arr,arr.length);        for(int i=0 ; i<arr.length ; i++)            System.out.print(arr[i] + " ");        }       /**      * 17 Cycle Sort 循环排序      */    public static void cycleSort()    {        int arr[] = { 1, 8, 3, 9, 10, 10, 2, 4 };        int n = arr.length;        SortingAlgorithms.SortingAlgorithm.cycleSort(arr, n);        System.out.println("After sort : ");        for (int i = 0; i < n; i++)            System.out.print(arr[i] + " ");    }       /**      * 18 Cocktail Sort 鸡尾酒排序      */    public static void cocktailSort()    {        int[] arr = {5, 2, 9, 3, 7, 6};        SortingAlgorithms.SortingAlgorithm.cocktailSort(arr);        System.out.println(Arrays.toString(arr));    }       /**      * 19 Strand Sort 经典排序      */    public static void strandSort()    {        List<Integer> inputList = new ArrayList<>();        inputList.add(10);        inputList.add(5);        inputList.add(30);        inputList.add(40);        inputList.add(2);        inputList.add(4);        inputList.add(9);        List<Integer> outputList = SortingAlgorithms.SortingAlgorithm.strandSort(inputList);        for (int x : outputList) {            System.out.print(x + " ");        }      }       /**      * 20  Bitonic Sort 双调排序      */    public static void BitonicSort()    {        int arr[] = {3, 7, 4, 8, 6, 2, 1, 5};        int up = 1;        SortingAlgorithms.SortingAlgorithm.BitonicSort(arr, arr.length,up);        System.out.println("\nSorted array");        int n = arr.length;        for (int i=0; i<n; ++i)            System.out.print(arr[i] + " ");        System.out.println();    }       /**      * 21 Pancake Sort 煎饼排序.      */    public static void pancakeSort()    {        int arr[] = {23, 10, 20, 11, 12, 6, 7};        int n = arr.length;        SortingAlgorithms.SortingAlgorithm.pancakeSort(arr, n);        System.out.println("Sorted Array: ");        for (int i = 0; i < n; i++)            System.out.print(arr[i] + " ");        System.out.println("");      }       /**      * 22 Bogo Sort  BogoSort or Permutation Sort 置换排序、愚蠢排序、慢排序、猎枪排序或猴子排序      */    public static void bogoSort()    {        // Enter array to be sorted here        int[] arr = { 3, 2, 5, 1, 0, 4 };        SortingAlgorithms.SortingAlgorithm.bogoSort(arr);        System.out.print("Sorted array: ");        for (int i = 0; i < arr.length; i++)            System.out.print(arr[i] + " ");        System.out.println();    }       /**      * 23 Gnome Sort 地精排序,也称侏儒排序      */    public static  void gnomeSort()    {        int arr[] = { 34, 2, 10, -9 };        SortingAlgorithms.SortingAlgorithm.gnomeSort(arr, arr.length);        System.out.print("Sorted sequence after applying Gnome sort: ");        System.out.println(Arrays.toString(arr));    }       /**      * 24.Sleep Sort 睡眠排序      */     public static void sleepSort()     {         ArrayList<Integer> arr = new ArrayList<>();         arr.add(34);   // Add elements to the ArrayList         arr.add(23);         arr.add(122);         arr.add(9);         SortingAlgorithms.SortingAlgorithm.sleepSort(arr); // Call the sleepSort function to sort the ArrayList     }       /**      *  25 Stooge Sort 臭皮匠排序      */     public static void stoogeSort()     {         int arr[] = { 2, 4, 5, 3, 1 };         int n = arr.length;           SortingAlgorithms.SortingAlgorithm.stoogeSort(arr, 0, n - 1);           for (int i = 0; i < n; i++)             System.out.print(arr[i] + " ");     }       /**      * 26 Tag Sort      */     public static void tagSort()     {         // Creating objects and their original         // order (in tag array)         int n = 5;         Person persons[] = new Person[n];         persons[0] = new Person(0, 233.5f);         persons[1] = new Person(1, 23f);         persons[2] = new Person(2, 13.98f);         persons[3] = new Person(3, 143.2f);         persons[4] = new Person(4, 3f);         int tag[] = new int[n];         for (int i = 0; i < n; i++)             tag[i] = i;           // Every Person object is tagged to         // an element in the tag array.         System.out.println("Given Person and Tag ");         for (int i = 0; i < n; i++)             System.out.println(persons[i] +                     " : Tag: " + tag[i]);           // Modifying tag array so that we can access         // persons in sorted order.         SortingAlgorithms.SortingAlgorithm.tagSort(persons, tag);           System.out.println("New Tag Array after "+                 "getting sorted as per Person[] ");         for (int i=0; i<n; i++)             System.out.println(tag[i]);           // Accessing persons in sorted (by salary)         // way using modified tag array.         for (int i = 0; i < n; i++)             System.out.println(persons[tag[i]]);       }       /**      * 27 Tree Sort      */     public static void TreeSort()     {          // Node root;         int arr[] = {5, 4, 7, 2, 11};         SortingAlgorithms.SortingAlgorithm.treeins(arr);         SortingAlgorithms.SortingAlgorithm.inorderRec(SortingAlgorithms.SortingAlgorithm.root);     }       /**      * 28.Brick Sort / Odd-Even Sort 砖排序算法（Brick Sort），也被称为奇偶排序（Odd-Even Sort）      */     public static void BrickSort()     {         int arr[] = {34, 2, 10, -9};         int n = arr.length;         SortingAlgorithms.SortingAlgorithm.oddEvenSort(arr, n);         for (int i=0; i < n; i++)             System.out.print(arr[i] + " ");         System.out.println(" ");       }       /**      * 29.3-way Merge Sort      */     public static void mergeSort3Way()     {         // test case of values         Integer[] data = new Integer[] {45, -2, -45, 78,                 30, -42, 10, 19, 73, 93};         SortingAlgorithms.SortingAlgorithm.mergeSort3Way(data);         System.out.println("After 3 way merge sort: ");         for (int i = 0; i < data.length; i++)             System.out.print(data[i] + " ");           }   }

　　

 

 

 

 

调用：

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

/**  * encoding: utf-8  * 版权所有 2023 ©涂聚文有限公司  * 许可信息查看：  * 描述：  * # Author    : geovindu,Geovin Du 涂聚文. *  * # IDE      : IntelliJ IDEA 2023.1 Java 21  *  * # Datetime  : 2023 - 2023/9/28 - 9:55  * # User      : geovindu  * # Product   : IntelliJ IDEA  * # Project   : EssentialAlgorithms  * # File      : Main.java  * # explain   : 学习 Sorting Algorithms 类  **/   import BLL.SortingExmaple;     public class Main {       /**      *      * */     public static void main(String[] args)     {         System.out.println("Hello world! Java, 涂聚文 geovindu Geovin Du 学习Java");           // 1.Bubble Sort冒泡排序法         SortingExmaple.Bubble();         //2.         SortingExmaple.Selection();         //3.         SortingExmaple.Insertion();         } }