aboutsummaryrefslogtreecommitdiff
path: root/challenge-268
diff options
context:
space:
mode:
authorMatthias Muth <matthias.muth@gmx.de>2024-05-12 23:24:12 +0200
committerMatthias Muth <matthias.muth@gmx.de>2024-05-12 23:24:12 +0200
commitdf8f71bb97cdadb3fe33cb79ebfbe9d1b5814cdb (patch)
treedfe93b0e8431a0b27992b0860c7145697a7f0c53 /challenge-268
parent552d90f67353da37873825a3cbd55599ff118a4b (diff)
downloadperlweeklychallenge-club-df8f71bb97cdadb3fe33cb79ebfbe9d1b5814cdb.tar.gz
perlweeklychallenge-club-df8f71bb97cdadb3fe33cb79ebfbe9d1b5814cdb.tar.bz2
perlweeklychallenge-club-df8f71bb97cdadb3fe33cb79ebfbe9d1b5814cdb.zip
Challenge 268 Task 1 and 2 solutions in Perl by Matthias Muth
Diffstat (limited to 'challenge-268')
-rw-r--r--challenge-268/matthias-muth/README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/challenge-268/matthias-muth/README.md b/challenge-268/matthias-muth/README.md
index b57cd748d1..6d58a3ad92 100644
--- a/challenge-268/matthias-muth/README.md
+++ b/challenge-268/matthias-muth/README.md
@@ -97,7 +97,7 @@ remove them from the input array
and add them -- in reversed order -- into the output array.
I don't like searching within a loop body.<br/>
-Even if we might not run into a purely quadratic big $`O`$ complexity just by searching
+Even if we might not run into a purely quadratic big O complexity just by searching
(because we shorten the array after each iteration),
destroying the input array just for that reason is not really elegant,
and even if it takes only split-micro-seconds,