diff options
| author | Adrien Hopkins <adrien.p.hopkins@gmail.com> | 2023-08-21 08:24:32 -0500 |
|---|---|---|
| committer | Adrien Hopkins <adrien.p.hopkins@gmail.com> | 2023-08-21 09:56:06 -0500 |
| commit | 30e92c33303535a86e56824b668f46ad0c6261a8 (patch) | |
| tree | df037059d07f48d1bd4ad434bf81b6e6688a032a /factors/prime_factorization.go | |
| parent | ff5bc533399cb7fc7b83afcc3a20e6abbc05d444 (diff) | |
Upgrade to Go 1.21
Use methods from the new slices and maps modules to make my code faster
and more compact.
Diffstat (limited to 'factors/prime_factorization.go')
| -rw-r--r-- | factors/prime_factorization.go | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/factors/prime_factorization.go b/factors/prime_factorization.go index 3f3abc7..69d0e08 100644 --- a/factors/prime_factorization.go +++ b/factors/prime_factorization.go @@ -2,7 +2,7 @@ package factors import ( "fmt" - "sort" + "slices" "strings" ) @@ -67,7 +67,7 @@ func (factors PrimeFactorization) String() string { for p := range factors.exponents { primes = append(primes, int(p)) } - sort.Ints(primes) + slices.Sort(primes) for _, p := range primes { if factors.Exponent(uint(p)) == 1 { |