Comments for Elegant Programming

Comment on Project Euler by solrize

solrize — Mon, 06 Oct 2008 10:32:36 +0000

Here is my 5 line (not counting comments) haskell solution:

– d n is the sum of all divisors of n from 1 to n-1
d n = sum [d | d<-[1..n-1], n`mod`d == 0]

– two numbers are amicable if they are unequal and (d a=b) and (d b=a)
amicable a b = (a /= b) && (d a == b) && (d b == a)

– list of all the amicable pairs [a,b] up to 10000
all_amicables = [[a, d a] | a<-[1..m], b<-[a+1..m], amicable a b]
where m = 10000

– find all the amicable pairs and add up the numbers in them
– this takes about 1 minute on my 1 ghz pentium 3
main = print (sum [a+b | [a,b] <- all_amicables])

Comment on Object-Oriented Design Principles by Object-oriented design principles | Elegant Programming

Object-oriented design principles | Elegant Programming — Wed, 16 Jul 2008 18:28:45 +0000

[...] article has been moved to http://elegant-programming.com/object-oriented-design-principles/ Share and Enjoy: These icons link to social bookmarking sites where readers can share and [...]

Comment on The Observer design pattern in .NET, part 1 by The Observer design pattern in .NET, part 2 | Elegant Programming

The Observer design pattern in .NET, part 2 | Elegant Programming — Tue, 10 Jun 2008 01:31:40 +0000

[...] is part 2 in a series about the Observer design pattern in .NET. In part one, we saw how to implement the pattern using the “classical” approach. In this part, [...]

Comment on VbRoboCode: Robot battle simulator by Mike Gold

Mike Gold — Wed, 09 Apr 2008 03:17:18 +0000

why not write this up as an article on C# Corner? That way 1000’s will see what you’ve done. And maybe you can give screen shots of what it looks like and explain how to program a robot.

Best,

-Mike Gold