111

3 files changed, 134 insertions, 0 deletions

diff --git a/challenge-111/dave-jacoby/blog.txt b/challenge-111/dave-jacoby/blog.txt
new file mode 100644
index 0000000000..bac9c714d4
--- /dev/null
+++ b/challenge-111/dave-jacoby/blog.txt
@@ -0,0 +1 @@
+   
diff --git a/challenge-111/dave-jacoby/perl/ch-1.pl b/challenge-111/dave-jacoby/perl/ch-1.pl
new file mode 100644
index 0000000000..8327f916e2
--- /dev/null
+++ b/challenge-111/dave-jacoby/perl/ch-1.pl
@@ -0,0 +1,100 @@
+#!/usr/bin/env perl
+
+use strict;
+use warnings;
+use feature qw{ say state postderef signatures };
+no warnings qw{ experimental };
+
+use Benchmark qw(:all);
+
+# You are given 5x5 matrix filled with integers such that
+# each row is sorted from left to right and the first
+# integer of each row is greater than the last integer of
+# the previous row.
+
+# Write a script to find a given integer in the matrix
+# using an efficient search algorithm.
+
+# But how do we know what's efficient?
+
+my $matrix = [
+    [ 1,  2,  3,  5,  7 ],
+    [ 9,  11, 15, 19, 20 ],
+    [ 23, 24, 25, 29, 31 ],
+    [ 32, 33, 39, 40, 42 ],
+    [ 45, 47, 48, 49, 50 ],
+];
+my $input1 = 35;
+my $input2 = 39;
+
+say uc 'are these correct?';
+say join "\t", '', '0', $input1, is_in_matrix_0( $matrix, $input1 );
+say join "\t", '', '0', $input2, is_in_matrix_0( $matrix, $input2 );
+say join "\t", '', '1', $input1, is_in_matrix_1( $matrix, $input1 );
+say join "\t", '', '1', $input2, is_in_matrix_1( $matrix, $input2 );
+say join "\t", '', '2', $input1, is_in_matrix_2( $matrix, $input1 );
+say join "\t", '', '2', $input2, is_in_matrix_2( $matrix, $input2 );
+say join "\t", '', '3', $input1, is_in_matrix_3( $matrix, $input1 );
+say join "\t", '', '3', $input2, is_in_matrix_3( $matrix, $input2 );
+say '';
+
+say uc 'which is fastest?';
+say '';
+my $count = 10_000_000;
+
+my $results = timethese(
+    $count,
+    {
+        'Sub0' => sub { is_in_matrix_0( $matrix, $input1 ) },
+        'Sub1' => sub { is_in_matrix_1( $matrix, $input1 ) },
+        'Sub2' => sub { is_in_matrix_2( $matrix, $input1 ) },
+        'Sub3' => sub { is_in_matrix_3( $matrix, $input1 ) },
+    },
+    'none'
+);
+cmpthese($results);
+
+# the SECOND WORST way: check everything unless/until
+# we find a match
+sub is_in_matrix_0 ( $matrix, $input ) {
+    my $hash = {};
+    for my $row ( $matrix->@* ) {
+        for my $v ( $row->@* ) {
+            return 1 if $v == $input;
+        }
+    }
+    return 0;
+}
+
+# the WORST way: put it all into a hash and check the hash
+sub is_in_matrix_1 ( $matrix, $input ) {
+    my $hash = {};
+    for my $row ( $matrix->@* ) {
+        for my $v ( $row->@* ) {
+            $hash->{$v}++;
+        }
+    }
+    return $hash->{$input} ? 1 : 0;
+}
+
+# SLIGHTLY less bad: the same but *memoized*
+sub is_in_matrix_2 ( $matrix, $input ) {
+    state $hash = {};
+    if ( !defined $hash->{ $matrix->[-1][-1] } ) {
+        for my $row ( $matrix->@* ) {
+            for my $v ( $row->@* ) { $hash->{$v}++; }
+        }
+    }
+    return $hash->{$input} ? 1 : 0;
+}
+
+# Checking every row to see if the value is within range
+# and THEN checking if it's in that row
+sub is_in_matrix_3 ( $matrix, $input ) {
+    for my $row ( $matrix->@* ) {
+        if ( $input > $row->[0] && $input < $row->[-1] ) {
+            for my $v ( $row->@* ) { return 1 if $v == $input; }
+        }
+    }
+    return 0;
+}
diff --git a/challenge-111/dave-jacoby/perl/ch-2.pl b/challenge-111/dave-jacoby/perl/ch-2.pl
new file mode 100644
index 0000000000..525b4e11fd
--- /dev/null
+++ b/challenge-111/dave-jacoby/perl/ch-2.pl
@@ -0,0 +1,33 @@
+#!/usr/bin/env perl
+
+use strict;
+use warnings;
+use feature qw{ say state postderef signatures };
+no warnings qw{ experimental };
+
+my @words = get_words();
+
+for my $word (@words) {
+    state $c = 0;
+    my $sort = sort_word($word);
+    if ( $sort eq $word ) {
+        say $word;
+        last if $c++ > 5;
+    }
+}
+
+sub get_words {
+    my $dict = '/usr/share/dict/words';
+    my @words;
+    if ( -f $dict && open my $fh, '<', $dict ) {
+        @words =
+            sort { length $b <=> length $a }
+            grep { length $_ > 1 }
+            map  { chomp $_; lc $_ } <$fh>;
+    }
+    return @words;
+}
+
+sub sort_word ( $word ) {
+    return join '', sort split //, $word;
+}