diff options
| author | James Smith <js5@sanger.ac.uk> | 2021-05-10 00:27:10 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-05-10 00:27:10 +0100 |
| commit | 90752924e6efce6cc70c29a8e63f39c93891d529 (patch) | |
| tree | 320d1f3b7e80676ad19f9f5cbd5936a9d21e3178 | |
| parent | 031500ce89b0da137e98fa5acf54ec1b8194c2e7 (diff) | |
| download | perlweeklychallenge-club-90752924e6efce6cc70c29a8e63f39c93891d529.tar.gz perlweeklychallenge-club-90752924e6efce6cc70c29a8e63f39c93891d529.tar.bz2 perlweeklychallenge-club-90752924e6efce6cc70c29a8e63f39c93891d529.zip | |
Update README.md
| -rw-r--r-- | challenge-111/james-smith/README.md | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/challenge-111/james-smith/README.md b/challenge-111/james-smith/README.md index 3f8dd0f132..71e2905051 100644 --- a/challenge-111/james-smith/README.md +++ b/challenge-111/james-smith/README.md @@ -422,9 +422,9 @@ Other things to note..: * I haven't included in this summary the two **preGrep** and **preHash** methods - which pre-flatten the matrix - and note that the **preHash** method is the fastest by far - nearly 4 times faster than are *best* method **DNFOpt**, even though the **Hash** method was worse (the ration of the two hash methods is approximately 40:1). This shows that if it is possible to cache some part of the calculation it can greatly improve performance if called lots of time. * All these comparisons are based on the 5x5 matrix in the question - and relative speeds may change as the matrix dimensions get larger. -** Quick extra addendum ** +** Quick extra addendum -Added another method which implements a binary search across the unflattened matrix - by effectively flattening the matrix and a 0..n location back into x,y-coorinates... +I've added another method which implements a binary search across the unflattened matrix - by effectively flattening the matrix and a 0..n location back into x,y-coorinates... ```perl sub find_val_binary { |