Haskell自我娱乐帖

无心人

牛顿迭代计算整数平方根

1. let nsqrtN (x, y, a) = (div (x + (div a x))  2, x, a)
   
2. let nsqrtLast (x, y, a) = abs(x-y)<=1
   
3. let nsqrtResult (x, y, a) =  if (x*x<=a) then x else (x-1)
   
4. let nsqrt a = if (a<4) then 1 else nsqrtResult \$ until nsqrtLast nsqrtN (1, a, a)

复制代码

无心人

1. 
   
2. let divisors n = Data.List.sort \$ (\(x, y)->x ++ y) \$ unzip [(x, div n x)|x<-[1..nsqrt n], mod n x == 0]
   

复制代码