Java Sorting Algorithm for code-heap sorting

Java Sorting Algorithm for code-heap sorting

1. /**
2. * Java sorting algorithm implements code-heap sorting.
3. *
4. * @ Author old zizhu Java century network (java2000.net)
5. *
6. */
7. Public class test {
8. Public static int [] heap = {10, 32, 1, 9, 5, 7, 12, 0, 4, 3}; // preset data array
10. Public static void main (string ARGs []) {
11. Int I; // The variable of the cyclic count.
12. Int Index = heap. length; // data index variable
14. System. Out. Print ("Before sorting :");
15. For (I = 1; I <index-1; I ++)
16. System. Out. printf ("% 3 s", heap [I]);
17. System. Out. println ("");
19. Heapsort (index-2); // heap sorting
21. System. Out. Print ("sorted :");
22. For (I = 1; I <index-1; I ++)
23. System. Out. printf ("% 3 s", heap [I]);
24. System. Out. println ("");
25. }
27. /**
28. * Create a heap
29. */
30. Public static void createheap (INT root, int index ){
31. Int I, j; // cyclic count variable
32. Int temp; // temporary variables
33. Int finish; // determines whether the heap has been established.
35. J = 2 * root; // index of the subnode
36. Temp = heap [root]; // store the root value of heap
37. Finish = 0; // the preset heap creation has not been completed.
39. While (j <= index & finish = 0 ){
40. If (j <index) // find the largest subnode
41. If (heap [J]
42. J ++;
43. If (temp> = heap [J])
44. Finish = 1; // heap created
45. Else {
46. Heap [J/2] = heap [J]; // parent node = current node
47. J = 2 * J;
48. }
49. }
50. Heap [J/2] = temp; // parent node = root Value
51. }
53. Public static void heapsort (INT index ){
54. Int I, j, temp;
55. // Convert binary tree into heap
56. For (I = (INDEX/2); I> = 1; I --)
57. Createheap (I, index );
59. // Start heap sorting
60. For (I = index-1; I> = 1; I --){
61. Temp = heap [I + 1]; // The root value of heap is exchanged with the last value.
62. Heap [I + 1] = heap [1];
63. Heap [1] = temp;
64. Createheap (1, I); // rebuild the heap for other values
66. System. Out. Print ("sorting :");
67. For (j = 1; j <= index; j ++)
68. System. Out. printf ("% 3 s", heap [J]);
69. System. Out. println ("");
70. }
71. }
72. }

/*** Java sorting algorithm implements code-heap sorting. ** @ Author old zizhu Java century network (java2000.net) **/public class test {public static int [] heap = {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 = heap. length; // The data index variable system. out. print ("Before sorting:"); for (I = 1; I <index-1; I ++) system. out. printf ("% 3 s", heap [I]); system. out. println (""); heapsort (index-2); // heap sorting system. out. print ("sorted:"); for (I = 1; I <index-1; I ++) system. out. printf ("% 3 s", heap [I]); system. out. println ("");}/*** create heap */public static void createheap (INT root, int index) {int I, j; // The Int temp variable of the cyclic count; // Save the int finish variable; // determine whether the heap has been established. j = 2 * root; // The index temp = heap [root] of the subnode. // The root value of the temporary Heap Storage is finish = 0; // The default heap creation is not completed while (j <= index & finish = 0) {If (j <index) // find the largest subnode if (heap [J] 
Running result

Before sorting: 32 1 9 5 7 12 0 4

Sorting: 12 7 9 5 1 4 0 32

Sorting: 9 7 4 5 1 0 12 32

Sorting: 7 5 4 0 1 9 12 32

Sorting: 5 1 4 0 7 9 12 32

Sorting: 4 1 0 5 7 9 12 32

Sorting: 1 0 4 5 7 9 12 32

Sorting: 0 1 4 5 7 9 12 32

After sorting: 0 1 4 5 7 9 12 32