no iterations

[Andrew Rissing]

Btw, I hope the OP does realize that you haven't infact removed the loop, but just hidden it inside a method call. I can just see the teacher looking at this and going...you know...I really just wanted a recursive method.

[Luc Pattyn]

well, a recursion is also a loop, as it executes the same code over and over again; luckily all he really asked to get rid of was a for loop, so a simple while could have sufficed. PS: yeah, I don't mind freaking out a teacher once in a while. :)

Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles] Nil Volentibus Arduum

Please use < PRE > tags for code snippets, it preserves indentation, and improves readability.

[Luc Pattyn]

hmm. Not quite, Binet's formula would give better performance than any loop or recursion once n goes up. And please don't think of doing these things recursively (unless you cache intermediate results), it would take very long as it has exponential behavior. :)

Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles] Nil Volentibus Arduum

Please use < PRE > tags for code snippets, it preserves indentation, and improves readability.

[Andrew Rissing]

To me, it just sounded like there was a bit of confusion on his part as to what he was really aiming for. Hence, my observation.

[Andrew Rissing]

NetQuestions wrote:

I want to initialize a string array with "*".

That part and the subsequent responses regarding that from you and Ennis just confused me over what he actually wants. </spam>

[PIEBALDconsult]

MyGodItsFullOfStars

[Luc Pattyn]

BestSoFar :)

Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles] Nil Volentibus Arduum

Please use < PRE > tags for code snippets, it preserves indentation, and improves readability.

[Abhinav S]

Luc Pattyn wrote:

Sorry, rejected by at least a dozen FxCop rules.

GAH - you did not tell me you had FXCop running. :)

[Andrew Rissing]

:laugh: Got my vote.

[ricmil42]

FibonacciStrings ( )

[dawmail333]

HereBeDragons(n) ;P Or even better: uβerπ(n) :laugh: EDIT: If you can't read that, it says uBer(pi)

[Abhinav S]

ricmil42 wrote:

FibonacciStrings ( )

That sounds like an actual answer - no fun. ;P

[Hired Mind]

How about:

    private static readonly double WhatDoesThisMean = 0.5 + Math.Sqrt(5);
    private static readonly double WhatDoesThisMean2 = 0.5 - Math.Sqrt(1.25);

    public static string\[\] **DesparatelyNeedsRefactoring**(int n)
    {
        if (n < 1) 
            throw new ArgumentException("n must be greater than zero");

        double d = Math.Pow(WhatDoesThisMean, n) - Math.Pow(WhatDoesThisMean2, n);

        var stringLength = (int) Math.Round(d / WhatDoesThisMean);
        return new string('\*', stringLength).Replace("\*", ".\*").Substring(1).Split('.');
    }

Note that I would refactor the variable 'stringLength' out as well - I put that in there to try and figure out what was going on, before I gave up and Googled.

Before .NET 4.0, object Universe = NULL;

[Luc Pattyn]

Hired Mind wrote:

I gave up and Googled

and? :)

Luc Pattyn [Forum Guidelines] [Why QA sucks] [My Articles] Nil Volentibus Arduum

Please use <PRE> tags for code snippets, they preserve indentation, and improve readability.

[Hired Mind]

Got distracted by productive work, and then you gave a the answer in another post. Fibonacci sequence right?

Before .NET 4.0, object Universe = NULL;

[Hal Angseesing]

I must say I was rather pleased with myself at having worked out the correct answer before reading this post (and another) with the correct answer in. Of course if anybody actually implemented this in production code they would be told off. Reminds me of the pointer trickery fun we used to do in C "for performance reasons" :)