github/perlweeklychallenge-club.git/challenge-080/tyler-wardhaugh, branch master

- Proposed patch to security issues in Clojure solutions.

2024-04-10T19:04:10+00:00

Ch80/Task 2 (lua): improve algorithm

2020-10-01T20:31:05+00:00

Ch80/Task 2 (clj): improve algorithm

2020-10-01T20:31:05+00:00

Ch80/Task 1 (clj): add third algorithm

2020-10-01T20:31:05+00:00

Also add benchmarking for this newest algorithm.

Ch80: add Lua solutions

2020-10-01T06:00:37+00:00

Ch80/Task 1: handle sequences without gaps

2020-09-29T20:15:51+00:00

The smallest positive integer for the sequence [1 2 3 4] is 5 (i.e., 1 +
the maximum).

Add a test to check for this.

Ch80/Task 1: introduce a more efficient algorithm

2020-09-29T20:14:14+00:00

Constructing a set is elegant but not memory-efficient when dealing with
large numbers.

Add benchmarking to demonstrate the difference.

Also, change the original algorithm (and add a test) to ensure 1 is
returned when no positive integers are provided.

Ch80: Task 2

2020-09-28T22:47:45+00:00

Ch80: Task 1

2020-09-28T22:47:40+00:00

Ch80: prep files for new challenge

2020-09-28T18:23:20+00:00