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
|
#!/usr/bin/env perl6
# Exercise 2.2.1
sub sphere-volume($r) { 4/3 * π * $r³ }
# Exercise 3.1
# Notice the operator precedence
sub rjust(Str $str, Int $width = 70) { ' ' x $width - $str.chars ~ $str }
#put rjust("Larry Wall", 80);
# Exercise 3.2
sub print-twice($str) {
put $str;
put $str
}
sub do-twice(&code, $arg) {
code $arg;
code $arg
}
#do-twice(&print-twice, "What's up doc");
sub do-four(&code, $arg) { do-twice { do-twice &code, $_ }, $arg }
# Exercise 3.3
sub grid(Int $rows=2, Int $cols=2, Int $side=4) {
(('+' for 0..$cols).join((' ' for 0..$side).join('-'))~"\n" for 0..$rows)
.join((('|' for 0..$cols).join(' ' x $side*2 + 1)~"\n") x $side)
}
#print grid(4, 4);
# Exercise 4.2
sub check-fermat(Int $a, Int $b, Int $c, Int $n) {
return if $n <= 2;
if $a**$n + $b**$n == $c**$n {
put "Holy smokes, Fermat was wrong!"
} else {
put "No, that doesn't work."
}
}
# Exercise 4.3
sub is-triangle($a, $b, $c) { ([-] reverse sort $a, $b, $c) < 0 }
# Exercise 4.4
sub fibonacci(Int $n, Int $a = 0, Int $b = 1) {
return $a if $n <= 0; #put $a;
fibonacci $n - 1, $b, $a + $b
}
#put fibonacci 20;
sub hypotenuse($a, $o) { sqrt $a² + $o² }
#put hypotenuse 3, 4;
# Exercise 5.2
multi ack(0, Int $n) { $n + 1 }
multi ack(Int $m where * > 0, 0) { ack $m - 1, 1 }
multi ack(Int $m where * > 0, Int $n where * > 0) {
ack $m - 1, ack($m, $n - 1)
}
#put ack 3, 4;
# Exercise 5.3
sub is-palindrome(Str $str) { $str eq $str.flip }
# Exercise 5.4
sub is-power-of($a, $b) { { $_ == $_.Int }(log $a, $b) }
# Exercise 5.5: gcd is a built-in operator
# Exercise 6.1
sub my-sqrt($a, $epsilon = 0.000_000_1, $x = $a) {
return $x if abs $x² - $a < $epsilon;
my-sqrt $a, $epsilon, ($x + $a/$x) / 2
}
# Exercise 6.2
sub factorial(Int $n) { [*] 1..$n }
sub estimate-pi {
my $factor = 2 * 2.sqrt / 9801;
sub Srinivasa-Ramanujan($k = 1, $current = 1103, $result = 1103) {
my $next = factorial($k * 4) * (1103 + $k*26390)
/ factorial($k)⁴ / 396**($k*4);
return $result + $next if $factor * $next < 10**-15;
Srinivasa-Ramanujan $k + 1, $next, $result + $next;
}
1 / $factor / Srinivasa-Ramanujan
}
#put abs estimate-pi() - pi;
sub ducks { map * ~ 'ack' , flat('J'..'N', 'Ou', 'P', 'Qu') }
#put ducks;
sub count(Str $string, Str $substr, Int $index = 0, Int $result = 0) {
my $i = index $string, $substr, $index;
return $result if $i === Any;
count $string, $substr, $i + 1, $result + 1
}
#put count 'banana', 'na';
sub bubble-sort(@seq is copy) {
my $done;
repeat {
$done = True;
for ^(@seq.elems - 1) -> $i {
if @seq[$i] > @seq[$i+1] {
(@seq[$i], @seq[$i+1]) = @seq[$i+1], @seq[$i];
$done = False
}
}
} until $done;
@seq
}
#put bubble-sort <4 2 6 5 3 9 1>;
sub select-sort(@seq is copy) {
for ^(@seq.elems - 1) -> $i {
for $i..^@seq.elems -> $j {
(@seq[$i], @seq[$j]) = @seq[$j], @seq[$i] if @seq[$i] > @seq[$j]
}
}
@seq
}
#put select-sort <4 2 6 5 3 9 1>;
sub insert-sort(@seq is copy) {
for 1..^@seq.elems -> $i {
loop (my $j = $i; $j and @seq[$j] < @seq[$j - 1]; $j--) {
(@seq[$j], @seq[$j - 1]) = @seq[$j - 1], @seq[$j]
}
}
@seq
}
#put insert-sort <4 2 6 5 3 9 1>;
|
