diff options
| -rw-r--r-- | challenge-111/abigail/README.md | 2 | ||||
| -rw-r--r-- | challenge-111/abigail/blog.txt | 1 | ||||
| -rw-r--r-- | challenge-111/abigail/blog1.txt | 1 | ||||
| -rw-r--r-- | challenge-111/abigail/c/ch-1.c | 2 | ||||
| -rw-r--r-- | challenge-111/abigail/lua/ch-1.lua | 4 | ||||
| -rw-r--r-- | challenge-111/abigail/pascal/ch-1.p | 2 | ||||
| -rw-r--r-- | challenge-111/abigail/t/ctest.ini | 1 |
7 files changed, 9 insertions, 4 deletions
diff --git a/challenge-111/abigail/README.md b/challenge-111/abigail/README.md index 39cfe578f6..021fb3375e 100644 --- a/challenge-111/abigail/README.md +++ b/challenge-111/abigail/README.md @@ -45,6 +45,7 @@ other using binary search. * [Ruby](ruby/ch-1.rb) ### Blog +[Perl Weekly Challenge 111: Search Matrix](https://abigail.github.io/HTML/Perl-Weekly-Challenge/week-111-1.html) ## [Ordered Letters](https://perlweeklychallenge.org/blog/perl-weekly-challenge-111/#TASK2) @@ -93,4 +94,5 @@ to standard output. In case of ties, we print the first one found. * [Ruby](ruby/ch-2.rb) ### Blog +[Perl Weekly Challenge 111: Ordered Letters](https://abigail.github.io/HTML/Perl-Weekly-Challenge/week-111-2.html) diff --git a/challenge-111/abigail/blog.txt b/challenge-111/abigail/blog.txt new file mode 100644 index 0000000000..0a0b135d11 --- /dev/null +++ b/challenge-111/abigail/blog.txt @@ -0,0 +1 @@ +https://abigail.github.io/HTML/Perl-Weekly-Challenge/week-111-1.html diff --git a/challenge-111/abigail/blog1.txt b/challenge-111/abigail/blog1.txt new file mode 100644 index 0000000000..da4eb0793f --- /dev/null +++ b/challenge-111/abigail/blog1.txt @@ -0,0 +1 @@ +https://abigail.github.io/HTML/Perl-Weekly-Challenge/week-111-2.html diff --git a/challenge-111/abigail/c/ch-1.c b/challenge-111/abigail/c/ch-1.c index a8804c7390..f51f118a87 100644 --- a/challenge-111/abigail/c/ch-1.c +++ b/challenge-111/abigail/c/ch-1.c @@ -13,7 +13,7 @@ # define MATRIX_SIZE 5 # define NR_OF_ELEMENTS (MATRIX_SIZE * MATRIX_SIZE) -static int compare (const void *a, const void *b) { +static int compare (const void * a, const void * b) { return * (int *) a - * (int *) b; } diff --git a/challenge-111/abigail/lua/ch-1.lua b/challenge-111/abigail/lua/ch-1.lua index 194e55b458..eb324dfa85 100644 --- a/challenge-111/abigail/lua/ch-1.lua +++ b/challenge-111/abigail/lua/ch-1.lua @@ -10,7 +10,7 @@ local MATRIX_SIZE = 5 -matrix = {} +local matrix = {} -- -- Read in the matrix @@ -24,7 +24,7 @@ end -- whether the number is present in the matrix or not. -- while true do - target = io . read ("*number") + local target = io . read ("*number") if target == nil then break end if matrix [target] then print (1) diff --git a/challenge-111/abigail/pascal/ch-1.p b/challenge-111/abigail/pascal/ch-1.p index b94e34fca9..75db5f1c79 100644 --- a/challenge-111/abigail/pascal/ch-1.p +++ b/challenge-111/abigail/pascal/ch-1.p @@ -42,7 +42,7 @@ function bsearch (matrix: matrix_type; target: Longint) : Integer; min := mid + 1; end else begin - max := mid - 1; + max := mid; end end end; diff --git a/challenge-111/abigail/t/ctest.ini b/challenge-111/abigail/t/ctest.ini index 1cfc7fa7ae..21377e579b 100644 --- a/challenge-111/abigail/t/ctest.ini +++ b/challenge-111/abigail/t/ctest.ini @@ -19,6 +19,7 @@ skip = Only one implementation [1-4,1-5,1-6/perl]
skip = 0
+args = bsearch
[2-1]
input_file = /Users/abigail/Words/enable.lst
|