From df8f71bb97cdadb3fe33cb79ebfbe9d1b5814cdb Mon Sep 17 00:00:00 2001 From: Matthias Muth Date: Sun, 12 May 2024 23:24:12 +0200 Subject: Challenge 268 Task 1 and 2 solutions in Perl by Matthias Muth --- challenge-268/matthias-muth/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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.
-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, -- cgit