Java Sorting Algorithm Implementation Code-shell sorting

Java Sorting Algorithm Implementation Code-shell sorting

1. /**
2. * The Java sorting algorithm implements code-shell sorting.
3. *
4. * @ Author old zizhu Java century network (java2000.net)
5. *
6. */
7. Public class test {
8. Public static int [] A = {10, 32, 1, 9, 5, 7, 12, 0, 4, 3}; // default data array
10. Public static void main (string ARGs []) {
11. Int I; // The variable of the cyclic count.
12. Int Index = A. length; // data index variable
14. System. Out. Print ("Before sorting :");
15. For (I = 0; I <index-1; I ++)
16. System. Out. printf ("% 3 s", a [I]);
17. System. Out. println ("");
19. Shellsort (index-1); // select sorting
20. // Sorted result
21. System. Out. Print ("sorted :");
22. For (I = 0; I <index-1; I ++)
23. System. Out. printf ("% 3 s", a [I]);
24. System. Out. println ("");
25. }
27. Public static void shellsort (INT index ){
28. Int I, j, k; // cyclic count variable
29. Int temp; // temporary variables
30. Boolean change; // whether the data is changed
31. Int datalength; // Interval Length of the split set
32. Int pointer; // The processing position.
34. Datalength = (INT) index/2; // The Interval Length of the initial set.
36. While (datalength! = 0) // The sequence can still be split
37. {
38. // Process each set
39. For (j = datalength; j <index; j ++ ){
40. Change = false;
41. Temp = A [J]; // Save the value of data [J], which is used for exchanging values
42. Pointer = J-datalength; // the location where the computation is processed
44. // Compare and exchange values in the Set
45. While (temp <A [pointer] & pointer> = 0 & pointer <= index ){
46. A [pointer + datalength] = A [pointer];
47. // Calculate the next location for processing
48. Pointer = pointer-datalength;
49. Change = true;
50. If (pointer <0 | pointer> index)
51. Break;
52. }
53. // Exchange with the final value
54. A [pointer + datalength] = temp;
56. If (Change ){
57. // Print the current sorting result
58. System. Out. Print ("sorting :");
59. For (k = 0; k <index; k ++)
60. System. Out. printf ("% 3 s", a [k]);
61. System. Out. println ("");
62. }
63. }
64. Datalength = datalength/2; // calculate the Interval Length of the next split
65. }
66. }
67. }

/*** Java sorting algorithm implements code-shell sorting. ** @ Author old zizhu Java century network (java2000.net) **/public class test {public static int [] A = {10, 32, 1, 9, 5, 7, 12, 0, 4, 3}; // default data array public static void main (string ARGs []) {int I; // The cyclic count variable int Index =. length; // The data index variable system. out. print ("Before sorting:"); for (I = 0; I <index-1; I ++) system. out. printf ("% 3 s", a [I]); system. out. println (""); shellsort (index-1); // select the sorting result system. out. print ("after sorting: "); For (I = 0; I <index-1; I ++) system. out. printf ("% 3 s", a [I]); system. out. println ("");} public static void shellsort (INT index) {int I, j, k; // The cyclic count variable int temp; // The temporary variable Boolean change; // whether the data changes int datalength; // whether the Interval Length of the split set is int pointer; // The processing position datalength = (INT) index/2; // The Interval Length of the initial set while (datalength! = 0) // The sequence can still be split {// process each set for (j = datalength; j <index; j ++) {change = false; temp = A [J]; // Save the value of data [J]. Use Pointer = J-datalength to exchange the value; // calculate the processing position // compare the values in the set with the exchange value while (temp <A [pointer] & pointer> = 0 & pointer <= index) {A [pointer + datalength] = A [pointer]; // calculate the next vertex to be processed. pointer = pointer-datalength; change = true; if (pointer <0 | pointer> index) break;} // exchange a [pointer + datalength] = temp with the final value; If (change) {// print the current sorting result system. out. print ("in sorting:"); For (k = 0; k <index; k ++) system. out. printf ("% 3 s", a [k]); system. out. println ("") ;}} datalength = datalength/2; // calculate the Interval Length of the next split }}}

Running result

Before sorting: 10 32 1 9 5 7 12 0 4

Sorting: 5 32 1 9 10 7 12 0 4

Sorting: 5 7 1 9 10 32 12 0 4

Sorting: 5 7 1 0 10 32 12 9 4

Sorting: 4 7 1 0 5 32 12 9 10

Sorting: 1 7 4 0 5 32 12 9 10

Sorting: 1 0 4 7 5 32 12 9 10

Sorting: 1 0 4 7 5 9 12 32 10

Sorting: 1 0 4 7 5 9 10 32 12

Sorting: 0 1 4 7 5 9 10 32 12

Sorting: 0 1 4 5 7 9 10 32 12

Sorting: 0 1 4 5 7 9 10 12 32

After sorting: 0 1 4 5 7 9 10 12 32