[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Bug-gnubg] OT: An algorithm problem

From: Massimiliano Maini
Subject: Re: [Bug-gnubg] OT: An algorithm problem
Date: Fri, 9 Feb 2007 13:54:38 +0100

address@hidden wrote on 09/02/2007 12:30:36:

> Hi,
> As some of you may know I'm now taking an CS education. (At last).
> In an exercise in the course "Algorithm and complexity", I was faced
> with this challenge:
> Describe an algorithm that takes two ordered sets (implemented as
> arrays) S and T (no duplicates in the two sets) of size n, and k, to
> find the k-th smallest key in the union of S and T. The running time
> should be of order O(lg n).

Hmmm ... O(lg n) or O(lg k) ?


reply via email to

[Prev in Thread] Current Thread [Next in Thread]