The Weird and The Wonderful

Chris Losinger wrote:

$10 says thisDir.GetDirectories is recursive

Chris Losinger wrote:

so you only get immediate subdirs of the target dir ?

var TheDirectory = from dirs in thisDir.GetDirectories("*",SearchOption.AllDirectories)
                   orderby dirs.FullName
                   select dirs;

\\Where thisDir = new DirectoryInfo(@"C:\");
\\This gets the whole tree.  No recursion.

Paulo Zemek wrote:

Later, the interviewer was surprised, because I was the only one of the candidates to answer such question.

Paulo Zemek wrote:

In one of my interviews, I was asked to code a function to convert an string (char *, it was as C interview) into an int.

Considering that there are already a lot of functions that do it already, it looks stupid. Considering it was an way to know if I know how to solve problems, I did it.

using System;

namespace Test
{
    class fib 
    {
        double n = 0;
        public double next
        {
            get
            {
                return n;
            }

            set
            {
                n = Math.Round(((Math.Pow(fib.golden(),value)) - Math.Pow((1-fib.golden()),value)) / Math.Sqrt(5));
            }
        }

        private static double golden()
        {
            return (1 + Math.Sqrt(5)) / 2;

        }
    }
}

        public static double MyFib(int n)
        {
            fib f = new fib();
            f.next = n;
            return f.next;
        }

public static double NotEqual()
{
    double count;
    double result1 = 0;
    double result2 = 0;
    for (count = 1;; count++)
    {
        result1 = GoodFib(count);
        result2 = MyFib(count);
        if (result1 != Math.Floor(result2))
            break;
    }
    Console.WriteLine("Result1: [" + result1.ToString() + "]");
    Console.WriteLine("Result2: [" + result2.ToString() + "]");
    return count;
}

public static double LinerFib(double n)
{
    double previous = -1;
    double result = 1;
    double sum = 0;
    for (double i = 0; i <= n; ++i)
    {
        sum = result + previous;
        previous = result;
        result = sum;
    }
    return result;
}

_Erik_ wrote:

The problem is to do it in a recursive way with a good performance. If the interviewer had asked you, for example, to find an iterative way to solve Hanoi's Tower problem, golden proportion would not be there to help you.

_Erik_ wrote:

Ok, guy. Which part of "the really important thing here is not the problem itself, but the way you can solve it applying those restrictions" is the one you have not understood?