Admin/developer job

[ted leslie]

ops, hash would be O(N)   (O(1) per insert, N of them).
and O(NLogN+N) = O(NLogN) for sort.
i had factored out the N
tl

On Tue, Jan 11, 2011 at 12:48 AM, ted leslie <ted.leslie-Re5JQEeQqe8AvxtiuMwx3w at public.gmane.org> wrote:
> If you were on a tight memory system, wouldn't the O(logN) sort be best,
> but on assumed resources available the O(1) hash table is what they
> wanted in the answer?
> Of course a grossly small hash would end up doing mostly linear runs
> in the overflow buckets, making it worst then O(logN) sort.
> And if memory was really restricted, a exhaustive scan and mark would
> be the only way O(N^2) with only a bit needed for each (in additional
> storage).
> I am assuming the question had some "additional info" ?
> tl
>
> On Mon, Jan 10, 2011 at 8:25 PM, Alex Volkov <avolkov-Re5JQEeQqe8AvxtiuMwx3w at public.gmane.org> wrote:
>> Hello Everyone,
>>
>> Uken games -- a social game studio is looking for sysadmin/web engineer
>> (someone who knows a bit of linux and programming).
>>
>> http://jobs.davidcrow.ca/job/web-engineer-toronto-on-canada-uken-games-d1361b02b8/?d=1&source=site_home
>> http://jobs.davidcrow.ca/job/linux-system-administrator-toronto-on-canada-uken-games-f76b4e7f46/?d=1&source=site_home
>>
>>
>> They apparently taking their time and going over every resume, what the
>> ad doesn't say, they want someone not only to manage their MySQL servers
>> but also to optimize their queries, still give it a shot -- even I got
>> an interview this morning, which then proceeded to royally screw up, the
>> icing on the cake was a stupidly simple programming question which of
>> course I got wrong. Let's just say sorting huge array is not the most
>> efficient way of finding duplicate elements, and I gave that answer in
>> the most dickish way possible.
>>
>> Dear God, I have become a PHP programmer. Please, mock me tomorrow or
>> I'll never learn.
>>
>> Alex.
>>
>> --
>> The Toronto Linux Users Group.      Meetings: http://gtalug.org/
>> TLUG requests: Linux topics, No HTML, wrap text below 80 columns
>> How to UNSUBSCRIBE: http://gtalug.org/wiki/Mailing_lists
>>
>
--
The Toronto Linux Users Group.      Meetings: http://gtalug.org/
TLUG requests: Linux topics, No HTML, wrap text below 80 columns
How to UNSUBSCRIBE: http://gtalug.org/wiki/Mailing_lists