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
|
#! /usr/bin/node
"use strict"
function is_wigglesorted(l) {
for (let i = 0; i < l.length-1; i++) {
if (i % 2 == 0) {
if (l[i] >= l[i+1]) {
return false;
}
} else {
if (l[i] <= l[i+1]) {
return false;
}
}
}
return true;
}
function wigglesort(l) {
let s = l;
s.sort();
let le = s.length;
let p = Math.floor(le / 2);
let a = s.slice(0, p - 1);
let b = s.slice(p, -1);
let i = 0;
let o = [];
if (le % 2 == 1) {
o.push(s[p]);
b = s.slice(p + 1, -1);
i = 1;
}
for (let j = i; j < s.length; j++) {
if (j % 2 == 0) {
o.push(a.pop());
} else {
o.push(b.pop());
}
}
return o;
}
if (!is_wigglesorted([1,5,1,1,6,4])) {
process.stdout.write("Pass");
} else {
process.stdout.write("FAIL");
}
process.stdout.write(" ");
if (is_wigglesorted([1,6,1,5,1,4])) {
process.stdout.write("Pass");
} else {
process.stdout.write("FAIL");
}
process.stdout.write(" ");
if (!is_wigglesorted([1,3,2,2,3,1])) {
process.stdout.write("Pass");
} else {
process.stdout.write("FAIL");
}
process.stdout.write(" ");
if (is_wigglesorted([2,3,1,3,1,2])) {
process.stdout.write("Pass");
} else {
process.stdout.write("FAIL");
}
process.stdout.write(" ");
if (!is_wigglesorted([1,3,2,2,3,1])) {
process.stdout.write("Pass");
} else {
process.stdout.write("FAIL");
}
process.stdout.write(" ");
if (is_wigglesorted(wigglesort([1,5,1,1,6,4]))) {
process.stdout.write("Pass");
} else {
process.stdout.write("FAIL");
}
process.stdout.write(" ");
if (is_wigglesorted(wigglesort([1,3,2,2,3,1]))) {
process.stdout.write("Pass");
} else {
process.stdout.write("FAIL");
}
process.stdout.write(" ");
if (is_wigglesorted(wigglesort([1,3,2,2,2,3,1]))) {
process.stdout.write("Pass");
} else {
process.stdout.write("FAIL");
}
process.stdout.write("\n");
|