Article View: comp.lang.c.moderated
Article #1979Re: Good C Interview questions?
From: Gene Gorokhovsky
Date: Thu, 15 Feb 1996 03:18
Date: Thu, 15 Feb 1996 03:18
18 lines
1255 bytes
1255 bytes
Christopher R Volpe wrote: : : James Hu wrote: : > >>>>> In article <4fa794$2lb@solutions.solon.com>, : > >>>>> "Gene" == Gene Gorokhovsky <geneg@kandasoft.com> writes: : > : > [ Find the number that appears twice in a list of N numbers which : > contain all numbers from 1..N-1 in linear time, using constant : > addtional space. ] : : Any bounds on N here? Is this a general algorithms question where N can : grow arbitrarily large? Or are we relying upon C-specifig things, like : fitting everything in an unsigned long? The original problem was formulated with N=100. I would not give any points off for assuming N is unsigned short. Gene
Technical Details
Message-ID:
<4fu8m9$9oh@solutions.solon.com>Path:
arc1-ca.pugleaf.net!solon.com!not-for-mailReferences:
<4ec3vg$lst@solutions.solon.com> <4fa794$2lb@solutions.solon.com><4fbfu6$9mv@solutions.solon.com> <4feo78$479@solutions.solon.com> <4fp1eg$gu3@solutions.solon.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!solon.com!not-for-mail From: Gene Gorokhovsky <geneg@kandasoft.com> Newsgroups: comp.lang.c.moderated Subject: Re: Good C Interview questions? Date: 14 Feb 1996 21:18:33 -0600 Organization: K and A Software Sender: clc@solutions.solon.com Approved: clc@solutions.solon.com Message-ID: <4fu8m9$9oh@solutions.solon.com> References: <4ec3vg$lst@solutions.solon.com> <4fa794$2lb@solutions.solon.com><4fbfu6$9mv@solutions.solon.com> <4feo78$479@solutions.solon.com> <4fp1eg$gu3@solutions.solon.com> NNTP-Posting-Host: solutions.solon.com X-Mailer: Mozilla 2.0 (Win95; I)