Java Sorting Algorithm for code-insert sorting

Java Sorting Algorithm for code-insert sorting

1. /**
2. * The Java sorting algorithm implements code-insert 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. Print ("" + A [I] + "");
17. System. Out. println ("");
19. Insertsort (index-1); // select sorting
20. // Sorted result
21. System. Out. Print ("sorted :");
22. For (I = 0; I <index-1; I ++)
23. System. Out. Print ("" + A [I] + "");
24. System. Out. println ("");
25. }
27. Public static void insertsort (INT index ){
28. Int I, j, k; // cyclic count variable
29. Int insertnode; // The data variable to be inserted.
31. For (I = 1; I <index; I ++) // insert values in sequence
32. {
33. Insertnode = A [I]; // set the value to be inserted
34. J = I-1; // the start position of the array to be inserted
35. // Find the appropriate Insert Location
36. While (j> = 0 & insertnode <A [J]) {
37. A [J + 1] = A [J];
38. J --;
39. }
40. A [J + 1] = insertnode; // insert a value
41. // Print the current sorting result
42. System. Out. Print ("sorting :");
43. For (k = 0; k <index; k ++)
44. System. Out. Print ("" + A [k] + "");
45. System. Out. println ("");
46. }
47. }
48. }

/*** Java sorting algorithm implements code-insert 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. print ("" + A [I] + ""); system. out. println (""); insertsort (index-1); // select the sorting result system. out. print ("sorted:"); for (I = 0; I <index-1; I ++) system. out. print ("" + A [I] + ""); system. out. println ("");} public static void insertsort (INT index) {int I, j, k; // The cyclic count variable int insertnode; // to insert the data variable for (I = 1; I <index; I ++) // Insert the value in sequence {insertnode = A [I]; // set the value J = I-1; // start position of the array to be inserted // find the appropriate insert position while (j> = 0 & insertnode <A [J]) {A [J + 1] = A [J]; j --;} A [J + 1] = insertnode; // Insert the value into the system. // print the current sorting result. out. print ("in sorting:"); For (k = 0; k <index; k ++) system. out. print ("" + A [k] + ""); system. out. println ("");}}}

Running result

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

Sorting: 10 32 1 9 5 7 12 0 4

Sorting: 1 10 32 9 5 7 12 0 4

Sorting: 1 9 10 32 5 7 12 0 4

Sorting: 1 5 9 10 32 7 12 0 4

Sorting: 1 5 7 9 10 32 12 0 4

Sorting: 1 5 7 9 10 12 32 0 4

Sorting: 0 1 5 7 9 10 12 32 4

Sorting: 0 1 4 5 7 9 10 12 32

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