Author: ignougroup

Problem Detail: If we regard a tree as a partial ordered set, it becomes a special case of a join-semilattice. For a join-semilattice, we want to be able to compute the (unique) least upper bound of two elements (more or less) Read More …

Problem Detail: I’m currently studying for my algorithms final and I came across a practice problem that I can’t seem to figure out. Here’s the problem: Consider the following set of difference constraints: x1 – x4 <= 1 x2 – x1 Read More …

Problem Detail: We know that Turing machines and Lambda Calculus are equivalent in power. And There are proofs for that, I’m sure. But is there an algorithm, a systematic way for us to convert a Turing machine into a Lambda Calculus Read More …

Problem Detail: How to decode gamma code ($gamma$ code): 1110001110101011111101101111011 and get the gap sequence? Detailed information about Gamma codes ($gamma$ codes) with a brief example of decoding can be found here. But in their example there is only one case Read More …

Problem Detail: Here’s the problem. I’ve written a program that reads strings from stdin, and returns a random subset of those strings. The only other argument provided to the program is the length of the subset, $k$. The subset must contain Read More …

Problem Detail: Does the following recursive algorithm have a name? If so, what is it? procedure main(): myFilter = new Filter( myPrime = 2 ) //first prime number print 2 //since it would not otherwise be printed for each n in Read More …

Problem Detail: I am dealing with the problem of computing $ s = lfloor sqrt(x)rfloor$ with $x in [0,30000^2]$. The common sqrtf(x) on C language is too slow for this case, however it always gives me the correct result. I’ve tried Read More …