FilesExpand file tree

 master

/

code.js

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

56 lines (41 loc) · 1.38 KB

 master

/

code.js

Copy path

Top

File metadata and controls

• Code
• Blame

56 lines (41 loc) · 1.38 KB

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

46

47

48

49

50

51

52

53

54

55

56

logger._print('Original array = [' + D.join(', ') + ']');

function heapSort(array, size) {

var i, j, temp;

for (i = Math.ceil(size / 2) - 1; i >= 0; i--) {

heapify(array, size, i);

}

for (j = size - 1; j >= 0; j--) {

temp = array[0];

array[0] = array[j];

array[j] = temp;

tracer._notify(0, array[0])._notify(j, array[j]);

logger._print('Swapping elements : ' + array[0] + ' & ' + array[j])._wait();

tracer._denotify(0)._denotify(j);

tracer._select(j)._wait();

heapify(array, j, 0);

tracer._deselect(j);

}

}

function heapify(array, size, root) {

var largest = root;

var left = 2 * root + 1;

var right = 2 * root + 2;

var temp;

if (left < size && array[left] > array[largest]) {

largest = left;

}

if (right < size && array[right] > array[largest]) {

largest = right;

}

if (largest != root) {

temp = array[root];

array[root] = array[largest];

array[largest] = temp;

tracer._notify(root, array[root])._notify(largest, array[largest]);

logger._print('Swapping elements : ' + array[root] + ' & ' + array[largest])._wait();

tracer._denotify(root)._denotify(largest);

heapify(array, size, largest);

}

}

heapSort(D, D.length);

logger._print('Final array = [' + D.join(', ') + ']');