Hacker News new | past | comments | ask | show | jobs | submit login

Not an array language (AFAIU), but here are some of the mentioned problems solved in (glorious) Factor:

    : find-gcd ( nums -- gcd )
      [ infimum ] [ supremum ] bi gcd nip ;

    : max-wealth ( accounts -- n )
      [ sum ] map-supremum ;

    : which-max-wealth ( accounts -- i )
      [ sum ] supremum-by* drop ;

    primes-upto



Join us for AI Startup School this June 16-17 in San Francisco!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: