On Tue, Sep 04, 2012 at 02:17:40PM +0100, Dave Cross wrote:
And besides, I don't think I'd really want to work with a programmer
who didn't know what the Fibonacci sequence is :-)
I'd rather work with a good programmer who can't answer your question slickly
in the heat of an interview,
On Wed, 2012-09-05 at 09:01 +0200, Richard Foley wrote:
And besides, I don't think I'd really want to work with a programmer
who didn't know what the Fibonacci sequence is :-)
I'd rather work with a good programmer who can't answer your question slickly
in the heat of an interview,
David Hodgkinson writes:
On 4 Sep 2012, at 16:07, Smylers smyl...@stripey.com wrote:
Piers Cawley writes:
Tower of Hanoi is always a better example for solving with
recursion than the fibobloodynacci sequence. If nothing else, the
recursive solution isn't quite so immediately
One other point I wanted to make on this debate was:
No matter how strongly each of us feels about what is or is not a legitimate or
worthwhile interview question: part of the benefit of having this discussion is
finding out what other people think is important in an interview. Even if we
I concur.
Slightly OT: My daughter is looking for a job in London, but does NOT know
anything about the Fibonacci sequence. Girl-friday/actress type of thing?
--
Ciao
Richard Foley
http://www.rfi.net/books.html
On Wed, Sep 05, 2012 at 09:11:06AM +0100, Jason Clifford wrote:
On Wed,
On Tue, Sep 04, 2012 at 12:25:57PM -0400, Uri Guttman wrote:
On 09/04/2012 08:03 AM, Mr I wrote:
I've literally had people who were Senior programmers (whatever that
means) who, when given the instructions Given that fib(n) is equal to
fib(n-1) + fib(n-2) write a fib function in any language
On Wed, Sep 5, 2012 at 9:35 AM, Abigail abig...@abigail.be wrote:
Your first instinct should be Is there a generating function I can use?.
Try not to blow your cache pipeline with all that silly branching,
sub fib {
my $n = shift;
int(0.5 + (0.5+0.5*sqrt 5) ** $n / sqrt 5);
}
High five!
On Wednesday, September 5, 2012, Paul Makepeace wrote:
On Wed, Sep 5, 2012 at 9:35 AM, Abigail abig...@abigail.be javascript:;
wrote:
Your first instinct should be Is there a generating function I can
use?.
Try not to blow your cache pipeline with all that silly branching,
sub fib {
On Tue, Sep 4, 2012 at 12:31 PM, Paul Makepeace pa...@paulm.com wrote:
The spec for fib() was given; the spec for ved() was not. That is the
difference.
No, neither were spec'd enough to code from. (As is true for every
spec I've ever seen.)
Either should lead to questions before a single
On Tue, Sep 04, 2012 at 01:03:22PM +0100, Mr I said:
IMHO this is a typical example of an awful question!
It requires additional knowledge of the problem domain NOT asked by the
interviewer.Your assumption is that the candidiate knows:
a) the fibonacci sequence
b) mathematically how to
On 05/09/2012 17:35, Abigail wrote:
No. Well, it filters out the wannabees. It doesn't recognize the
serious coder. If, given the Fibonacci sequence, or a similar
recursive formula, and your first instinct is to solve it with
recursion or iteration, you aren't serious. Your first instinct
Given that fib(n) is equal to fib(n-1) + fib(n-2) write a fib
function in any language
The fib(n) task as stated tests three things of the candidate:
- Are you confident enough to consider that the interviewer might be
presenting a problem as complete which in fact requires some more
info? (And
On 5 September 2012 23:15, Daniel Perrett perret...@googlemail.com wrote:
The fib(n) task as stated tests three things of the candidate
You're missing a key point of interviewing. The task is used to test
how the candidate thinks, how they ask questions, how they explore a
problem space etc. It
On Wed, Sep 05, 2012 at 09:51:27PM +0100, Gordon Banner wrote:
Of course, almost all of them would use recursion, and my real interest
was in the follow-on discussion why did you do it that way?, and how
long it took them to twig that while factorials are a good illustration
of recursion,
ok now that the subject line has changed to reflect the interview process,
here is what i think the ideal interview is (experienced this both as
interviewee and as hiring manager.)
it should be a very short internship,
i.e. here is a masked part of a problem we are working on, lets discuss
this
On Thu, Sep 06, 2012 at 12:12:16AM +0200, Joel Bernstein said:
Really I find interviews are less about individual questions or tasks,
and more about where the conversation goes based on them and the
interviewer's abilities to steer the conversation and to assess the
candidate based on those
On 09/05/2012 06:34 PM, Simon Wistow wrote:
On Thu, Sep 06, 2012 at 12:12:16AM +0200, Joel Bernstein said:
Really I find interviews are less about individual questions or tasks,
and more about where the conversation goes based on them and the
interviewer's abilities to steer the conversation
17 matches
Mail list logo
