.NET at 9.400 ft above sea levelProgramming in Quito, 2.860 m above sea levelCloning objects in .NET- May 18, 2008 In an interesting project where I'm giving a hand, we need to clone objects of a number of different types, perhaps surprisingly the CLR doesn't offer a general cloning method, of course you could use MemberwiseClone() but this is a protected method, so it can be invoked only from inside the class of the object being cloned, which makes it difficult to use it in a general method, besides, MemberWiseClone() does just a shallow copy and what we really need is a deep copy. There is a good reason..http://weblogs.asp.net/esanchez/archive/2008/05/18/cloning-objects-in-net.aspx A cool way to find out whether a number is palindromic- May 6, 2008 In this blog entry I proposed a solution to Problem 4 at Project Euler, a crucial element of the problem is to find out whether a number is a palindrome (909 is, 809 isn't), a bit out of laziness and a bit in order to reuse existing methods, I decided to verify the palindrome by converting the number into a char array and then comparing this array with its mirror version, it works but it's not really that mathematical... Dustin Campbell proposed a solution kind of similar to mine (alas, more...http://weblogs.asp.net/esanchez/archive/2008/05/06/a-cool-way-to-find-out-whether-a-number... New version of F just released- May 3, 2008 In its way from research language to commercial language, Don Syme just announced that, silently, on May the 1st version 1.9.4.15 of F was released. &160; This new version incorporates a number of specific enhancements (F is now basically in stabilization mode, so we really shouldn't expect significative changes to the language). By the way, the example in the picture shows my idea for solving Problema 2 of Project&160; Euler: find the sum of all the even-valued terms in the Fibonacci...http://weblogs.asp.net/esanchez/archive/2008/05/03/new-version-of-f-just-released.aspx Which is the ten thousand first prime- May 2, 2008 Prime numbers have a good deal of practical applications (for example in cryptography) but let's face it, even if they would have none, they would still be the favorite toy of mathematicians. In Problem 7 of Project Euler, we are asked to find the 10001st element of the famous list, my approach was this: Define the infinite sequence of the prime numbers From this sequence, throw away the first 10000 items and then take the first of the remaining Creating an infinite sequence in C is..http://weblogs.asp.net/esanchez/archive/2008/05/02/which-is-the-ten-thousand-first-prime.a... |