Comments on: A case study in micro-optimization

By: Joe

Joe — Fri, 04 Sep 2009 13:00:39 +0000

While I like the solution, it’s not for the challange: I think original challange was “write a counter function that counts from 1 to max but only returns numbers whose digits don’t repeat”. I don’t see how your code returns anything.

By: dustin

dustin — Thu, 13 Aug 2009 15:40:55 +0000

@Madhavrao: Did you even read the post? It was all about optimizing the code for the fastest results.

Nice post, found this post while looking for the fastest way to read digits into C#. Not quite the answer, but interesting read.

By: sijin

sijin — Thu, 09 Apr 2009 10:38:19 +0000

Hi Madhav,

I was looking for the fastest solution The string and list based solutions are the slowest so I didn’t event mention them in the blog post.

By: Madhavrao

Madhavrao — Thu, 09 Apr 2009 09:08:38 +0000

I think you should try this:

class Program
{
static void Main(string[] args)
{
for(int i = 0; i < 10000; i++)
{
if (IsValidNumber(i))
Console.Write(“{0},”, i);
}

Console.ReadLine();
}

static bool IsValidNumber(Int32 number)
{
String sNumber = number.ToString();
var numbers = new List(sNumber.ToCharArray());
return numbers.Distinct().Count() == sNumber.Length;
}
}

By: Vivek

Vivek — Thu, 16 Oct 2008 17:59:05 +0000

Interesting read!

By: sijin

sijin — Fri, 29 Aug 2008 19:34:59 +0000

Hi Bob,

Nice to see that you read my post, your solution was what got me started on this in the first place. Thanks for clarifying about your solution.

By: Bob Lee

Bob Lee — Fri, 29 Aug 2008 18:52:08 +0000

FWIW, my solution does generate the #s in order and does find the biggest gap.

By: A case study in micro-optimization (Generating permutations) - Sijin Joseph's blog

Fri, 29 Aug 2008 16:48:05 +0000

[...] C# over at my personal blog. Couldn’t bear the thought of the fastest solution being a Java one http://www.indiangeek.net/2008/08/29/a-case-study-in-micro-optimization/ Published Aug 29 2008, 10:43 PM by Sijin Joseph Filed under: General Software [...]