FilesExpand file tree

main

/

sort-algorithms.js

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

162 lines (150 loc) · 5.4 KB

main

/

sort-algorithms.js

Copy path

Top

File metadata and controls

• Code
• Blame

162 lines (150 loc) · 5.4 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

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

"use strict";

class sortAlgorithms {

constructor(time) {

this.list = document.querySelectorAll(".cell");

this.size = this.list.length;

this.time = time;

this.help = new Helper(this.time, this.list);

}

// BUBBLE SORT

BubbleSort = async () => {

for(let i = 0 ; i < this.size - 1 ; ++i) {

for(let j = 0 ; j < this.size - i - 1 ; ++j) {

await this.help.mark(j);

await this.help.mark(j+1);

if(await this.help.compare(j, j+1)) {

await this.help.swap(j, j+1);

}

await this.help.unmark(j);

await this.help.unmark(j+1);

}

this.list[this.size - i - 1].setAttribute("class", "cell done");

}

this.list[0].setAttribute("class", "cell done");

}

// INSERTION SORT

InsertionSort = async () => {

for(let i = 0 ; i < this.size - 1 ; ++i) {

let j = i;

while(j >= 0 && await this.help.compare(j, j+1)) {

await this.help.mark(j);

await this.help.mark(j+1);

await this.help.pause();

await this.help.swap(j, j+1);

await this.help.unmark(j);

await this.help.unmark(j+1);

j -= 1;

}

}

for(let counter = 0 ; counter < this.size ; ++counter) {

this.list[counter].setAttribute("class", "cell done");

}

}

// SELECTION SORT

SelectionSort = async () => {

for(let i = 0 ; i < this.size ; ++i) {

let minIndex = i;

for(let j = i ; j < this.size ; ++j) {

await this.help.markSpl(minIndex);

await this.help.mark(j);

if(await this.help.compare(minIndex, j)) {

await this.help.unmark(minIndex);

minIndex = j;

}

await this.help.unmark(j);

await this.help.markSpl(minIndex);

}

await this.help.mark(minIndex);

await this.help.mark(i);

await this.help.pause();

await this.help.swap(minIndex, i);

await this.help.unmark(minIndex);

this.list[i].setAttribute("class", "cell done");

}

}

// MERGE SORT

MergeSort = async () => {

await this.MergeDivider(0, this.size - 1);

for(let counter = 0 ; counter < this.size ; ++counter) {

this.list[counter].setAttribute("class", "cell done");

}

}

MergeDivider = async (start, end) => {

if(start < end) {

let mid = start + Math.floor((end - start)/2);

await this.MergeDivider(start, mid);

await this.MergeDivider(mid+1, end);

await this.Merge(start, mid, end);

}

}

Merge = async (start, mid, end) => {

let newList = new Array();

let frontcounter = start;

let midcounter = mid + 1;

while(frontcounter <= mid && midcounter <= end) {

let fvalue = Number(this.list[frontcounter].getAttribute("value"));

let svalue = Number(this.list[midcounter].getAttribute("value"));

if(fvalue >= svalue) {

newList.push(svalue);

++midcounter;

}

else {

newList.push(fvalue);

++frontcounter;

}

}

while(frontcounter <= mid) {

newList.push(Number(this.list[frontcounter].getAttribute("value")));

++frontcounter;

}

while(midcounter <= end) {

newList.push(Number(this.list[midcounter].getAttribute("value")));

++midcounter;

}

for(let c = start ; c <= end ; ++c) {

this.list[c].setAttribute("class", "cell current");

}

for(let c = start, point = 0 ; c <= end && point < newList.length;

++c, ++point) {

await this.help.pause();

this.list[c].setAttribute("value", newList[point]);

this.list[c].style.height = `${3.5*newList[point]}px`;

}

for(let c = start ; c <= end ; ++c) {

this.list[c].setAttribute("class", "cell");

}

}

// QUICK SORT

QuickSort = async () => {

await this.QuickDivider(0, this.size-1);

for(let c = 0 ; c < this.size ; ++c) {

this.list[c].setAttribute("class", "cell done");

}

}

QuickDivider = async (start, end) => {

if(start < end) {

let pivot = await this.Partition(start, end);

await this.QuickDivider(start, pivot-1);

await this.QuickDivider(pivot+1, end);

}

}

Partition = async (start, end) => {

let pivot = this.list[end].getAttribute("value");

let prev_index = start - 1;

await this.help.markSpl(end);

for(let c = start ; c < end ; ++c) {

let currValue = Number(this.list[c].getAttribute("value"));

await this.help.mark(c);

if(currValue < pivot) {

prev_index += 1;

await this.help.mark(prev_index);

await this.help.swap(c, prev_index);

await this.help.unmark(prev_index);

}

await this.help.unmark(c);

}

await this.help.swap(prev_index+1, end);

await this.help.unmark(end);

return prev_index + 1;

}

};