Comments on: Here be the Code Monkeys http://lbrandy.com/blog/2008/09/here-be-the-code-monkeys/ { on programming and the internets, every monday } Thu, 17 May 2012 07:59:48 +0000 hourly 1 http://wordpress.org/?v=3.0.1 By: key http://lbrandy.com/blog/2008/09/here-be-the-code-monkeys/comment-page-1/#comment-29444 key Thu, 17 May 2012 07:14:58 +0000 http://lbrandy.com/blog/?p=98#comment-29444 Is laminated glass from several layers of glass <a href="http://xn--80aafybakikq7bg7c.org" rel="nofollow"> ремонт на автоклиматици </a>glued together with resin.<a href="http://aluminievadograma.com/" rel="nofollow"> дограма </a> Is laminated glass from several layers of glass ремонт на автоклиматици glued together with resin. дограма

]]> By: key http://lbrandy.com/blog/2008/09/here-be-the-code-monkeys/comment-page-1/#comment-29410 key Wed, 18 Apr 2012 11:32:42 +0000 http://lbrandy.com/blog/?p=98#comment-29410 Identifying potential opportunities for development, <a href="http://vimaks-klimatici.com/" rel="nofollow"> климатици </a> promotion or transfer. Identification of training needs and qualifications. Providing information for the review of remuneration Identifying potential opportunities for development, климатици promotion or transfer. Identification of training needs and qualifications. Providing information for the review of remuneration

]]> By: key http://lbrandy.com/blog/2008/09/here-be-the-code-monkeys/comment-page-1/#comment-29384 key Wed, 18 Apr 2012 08:37:25 +0000 http://lbrandy.com/blog/?p=98#comment-29384 Where appropriate, during these checks medzhinni <a href="http://xn--hxajxbacedk6ejc.net" rel="nofollow"> κλιματιστικά </a> corrective action. Where appropriate, during these checks medzhinni κλιματιστικά corrective action.

]]> By: La caída de las lámparas « Spin Foam http://lbrandy.com/blog/2008/09/here-be-the-code-monkeys/comment-page-1/#comment-25760 La caída de las lámparas « Spin Foam Mon, 02 Nov 2009 16:46:57 +0000 http://lbrandy.com/blog/?p=98#comment-25760 [...] (Extraído del blog de Louis Brandy.) [...] [...] (Extraído del blog de Louis Brandy.) [...]

]]> By: Algunas respuestas y un problema simple « Spin Foam http://lbrandy.com/blog/2008/09/here-be-the-code-monkeys/comment-page-1/#comment-25759 Algunas respuestas y un problema simple « Spin Foam Sun, 01 Nov 2009 20:19:09 +0000 http://lbrandy.com/blog/?p=98#comment-25759 [...] (Extraído del blog de Louis Brandy.) [...] [...] (Extraído del blog de Louis Brandy.) [...]

]]> By: chalks http://lbrandy.com/blog/2008/09/here-be-the-code-monkeys/comment-page-1/#comment-549 chalks Mon, 03 Nov 2008 02:01:44 +0000 http://lbrandy.com/blog/?p=98#comment-549 I've read your entire blog over the past few days, and really enjoyed it. The lightbulb question got me thinking, and I came up with an answer I like. Here it is: drop the first light bulb once every 10 floors (at 10, 20, 30, etc). Once it breaks, drop the second bulb from the previous unbroken floor one floor at a time till it breaks (at 11, 12, 13, ... 18). Worst case you drop the first bulb 10 times, and the second bulb 8 times. Best case you drop both bulbs once. Furthermore, to generalize this for N floors: take x=ceiling(sqrt(N)) drop the first egg once every x floors. Second egg drops maximum of x-2 times. Which means that worst case scenario for N floors is 2*(x-1) drops. I think. I had a lot of fun thinking about this. :D I’ve read your entire blog over the past few days, and really enjoyed it. The lightbulb question got me thinking, and I came up with an answer I like. Here it is:

drop the first light bulb once every 10 floors (at 10, 20, 30, etc). Once it breaks, drop the second bulb from the previous unbroken floor one floor at a time till it breaks (at 11, 12, 13, … 18). Worst case you drop the first bulb 10 times, and the second bulb 8 times. Best case you drop both bulbs once.

Furthermore, to generalize this for N floors:
take x=ceiling(sqrt(N))
drop the first egg once every x floors. Second egg drops maximum of x-2 times. Which means that worst case scenario for N floors is 2*(x-1) drops. I think. I had a lot of fun thinking about this. :D

]]> By: Bob Igo http://lbrandy.com/blog/2008/09/here-be-the-code-monkeys/comment-page-1/#comment-482 Bob Igo Wed, 29 Oct 2008 22:47:41 +0000 http://lbrandy.com/blog/?p=98#comment-482 Interesting binary search variant, but I think the challenge with these is coming up with scenarios in which candidates could imagine these being realistic constraints. My first reaction to this was that it's clever as a puzzle, but horrible as a QA plan :) If I were being interviewed to conduct any kind of testing, I'd be a bit worried that the puzzle was a metaphor for my testing resources. Interesting binary search variant, but I think the challenge with these is coming up with scenarios in which candidates could imagine these being realistic constraints. My first reaction to this was that it’s clever as a puzzle, but horrible as a QA plan :) If I were being interviewed to conduct any kind of testing, I’d be a bit worried that the puzzle was a metaphor for my testing resources.

]]>