diff options
| author | John Bampton <jbampton@users.noreply.github.com> | 2023-03-01 04:05:30 +1000 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2023-02-28 10:05:30 -0800 |
| commit | c43fbe4ebd2b519601f0b90ca98fa096799d3846 (patch) | |
| tree | 08b54264b5fa5ef737c429b10969877239803eeb /benchmark | |
| parent | 966adfb79982436e552a7a65b8124b0a579e40c3 (diff) | |
Fix spelling (#7405)
Notes
Notes:
Merged-By: k0kubun <takashikkbn@gmail.com>
Diffstat (limited to 'benchmark')
| -rw-r--r-- | benchmark/so_meteor_contest.rb | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/benchmark/so_meteor_contest.rb b/benchmark/so_meteor_contest.rb index 8c136baa6c..d8c8e3ab9c 100644 --- a/benchmark/so_meteor_contest.rb +++ b/benchmark/so_meteor_contest.rb @@ -447,7 +447,7 @@ end # as an inverse. The inverse will ALWAYS be 3 one of the piece configurations that is exactly 3 rotations away # (an odd number). Checking even vs odd then produces a higher probability of finding more pieces earlier # in the cycle. We still need to keep checking all the permutations, but our probability of finding one will -# diminsh over time. Since we are TOLD how many to search for this lets us exit before checking all pieces +# diminish over time. Since we are TOLD how many to search for this lets us exit before checking all pieces # this bennifit is very great when seeking small numbers of solutions and is 0 when looking for more than the # maximum number def find_top( rotation_skip) |