Java Sorting Algorithm Implementation Code-select-type sorting

Java Sorting Algorithm Implementation Code-select-type sorting

1. /**
2. * The Java sorting algorithm implements code-select-based 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. Selectsort (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 selectsort (INT index ){
28. Int I, j, k; // cyclic count variable
29. Int minvalue; // minimum variable
30. Int indexmin; // minimum index variable
31. Int temp; // temporary variables
33. For (I = 0; I <index-1; I ++ ){
34. Minvalue = 32767; // current minimum value
35. Indexmin = 0; // store the index value of the minimum value
36. For (j = I; j <index; j ++ ){
37. If (A [J] <minvalue) // locate the minimum value
38. {
39. Minvalue = A [J]; // minimum value for storage
40. Indexmin = J;
41. }
42. Temp = A [I]; // exchanges two values.
43. A [I] = A [indexmin];
44. A [indexmin] = temp;
45. }
47. System. Out. Print ("sorting :");
48. For (k = 0; k <index; k ++)
49. System. Out. printf ("% 3 s", a [k]);
50. System. Out. println ("");
51. }
52. }
53. }

/*** Java sorting algorithm implements code-select-based 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 (""); selectsort (index-1); // select the sorting result system. out. print ("sorted:"); for (I = 0; I <index-1; I ++) system. out. printf ("% 3 s", a [I]); system. out. println ("");} public static void selectsort (INT index) {int I, j, k; // The Int minvalue variable of the cyclic count; // The Int indexmin variable of the minimum value; // minimum index variable int temp; // temporary variable for (I = 0; I <index-1; I ++) {minvalue = 32767; // currently, the minimum value indexmin = 0; // store the index value of the minimum value for (j = I; j <index; j ++) {if (a [J] <minvalue) // find the minimum value {minvalue = A [J]; // store the minimum value indexmin = J;} temp = A [I]; // exchange two values a [I] = A [indexmin]; A [indexmin] = temp;} system. out. print ("in sorting:"); For (k = 0; k <index; k ++) system. out. printf ("% 3 s", a [k]); system. out. println ("");}}}

Running result

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

Sorting: 1 32 10 9 5 7 12 0 4

Sorting: 1 5 32 10 9 7 12 0 4

Sorting: 1 5 9 32 10 7 12 0 4

Sorting: 1 5 9 10 32 7 12 0 4

Sorting: 1 5 9 10 32 7 12 0 4

Sorting: 1 5 9 10 32 7 12 0 4

Sorting: 1 5 9 10 32 7 12 0 4

Sorting: 1 5 9 10 32 7 12 0 4

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