FilesExpand file tree

 master

/

heap.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

45 lines (39 loc) · 827 Bytes

 master

/

heap.java

Copy path

Top

File metadata and controls

• Code
• Blame

45 lines (39 loc) · 827 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package sort;

import java.util.Arrays;

public class heap {

static void swap(int []a, int i, int j) {

int temp=a[i];

a[i] = a[j];

a[j]= temp;

}

static void buildHeap(int[]a) {

int end=a.length-1;

for(int i=end/2;i>=0;--i)

heapify(a,i,end);

}

static void heapify(int[]a,int k,int end) {

int left=2*k+1, right=2*k+2;

int smaller;

if(right<=end)

smaller=(a[left]<a[right])?left:right;

else if(left<=end)

smaller=left;

else return;

if(a[smaller]<a[k]) {

swap(a,smaller,k);

heapify(a,smaller,end);

}

}

static void heapSort(int[] a) {

buildHeap(a);

for(int end=a.length-1;end>=1;--end) {

swap(a,0,end);

heapify(a,0,end-1);

}

}

public static void main(String[] args) {

int[]a= {3,8,2,10,4,6,7,1,9,5};

heapSort(a);

System.out.println(Arrays.toString(a));

}

}