[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.9550105 [View]
File: 66 KB, 691x682, compscidegree.png [View same] [iqdb] [saucenao] [google]
9550105

>>9550047
glad you said this, OP. I read a book on haskell a few years ago and decided it was retarded.

newState = someFunction(state)

there. do this and it makes testing easier because you don't have to mock everything. all the monad functor bullshit is just intellectual masturbation.

>> No.8852273 [View]
File: 66 KB, 691x682, compscidegree.png [View same] [iqdb] [saucenao] [google]
8852273

>>8852080
brainlet here. I know how to make a sieve of earthanus and the obvious way of brute force checking each number. Is there a better way to find primes that doesn't take either tons of time or tons of memory?

Navigation
View posts[+24][+48][+96]