0
branch golfing: sort a list by number of prime factors
Specifically, first sorted by total number of prime factors, with any
ties broken by number of unique prime factors (remove this?), then broken by size. The list will never contain 1.
Test cases:
[4,5,6,9] -> [5,4,9,6]
[10,11,12] -> [11,10,12...
0
Fluff
After taking a look at deadfish, I decided it sucked, so I came up with a new (and easier) variant of it: imnotdeadfish.
As with its predecessor, there are 4 commands and an accumulator which begins at 0:
+ # increment the accumulator
- # decrement the accumulator
s # square the accumulator...
Why should you golf in Haskell? Find out here. In that answer, Zgarb defines a task:
Let's define a function f that splits a list at the second occurrence of the first element, e.g. [0,2,2,3,0,1,0,1] -> ([0,2,2,3],[0,1,0,1]):
Alright then, lets!
You are to take a non-empty list consisting of di...
