Search:

It's OK to use vector instructions. The challenge is: can you do the multiply by "issuing only 3 arithmetic instructions" - as in machine instructions. It's very likely that the computer in front...

You've all had three years to strengthen your Kung Fu by pondering the reduction of the complex multiply from four multplications to three. Many have either moved up to management or lost their...

Press 'g' to turn off gravity. press 'esc' to exit. you lose 50 points if you don't click a duck by the time it goes off the screen. You get points proportional to the horizontal speed of the duck...

The phenomena with the speed is a result of a possible solution to this challenge: Find the primes without factoring any numbers.

Write a program that reads in an integer from the console and finds all positive prime numbers between 2 and the number. Challenge:Code the routine so that as your program progresses it becomes...

Design a binary code and write an encoder and decoder such that if as many as 3 bits of a codeword are encoded with errors, the decoder can correct the codeword. Obviously the only purpose of the...

The latter, I didn't realize my example was an xor too.

Challenge: Write a function that reverses the bits of an integer, i.e. 100110 -> 011001. The shorter the function the better. This is an essential procedure when coding a fast fourier transform.

Hey strogian g/j, you got all my challenges. :)

Here's another challenge:
rand( ) in C generates a flat distribution of numbers; you are equally likely to get any given number the generator is...

They might not factor but you could do it this way by calculating all of the roots to the desired precision, however this isn't the best way to solve the problem
...

The summer must be turning me into an imbicile. The n is correct. You can evaluate the polynomial with n products.

Here's another challenge: Write a function using only bit operations that can...

No, it's not a trick like that. It would still take 4 real multiplications to compute (ac-bd) and (ad+bc). There is a way to do it so you really only have to compute 3 products; and though it takes...

Compute the complex product ( a + ib ) * ( c + id ) using only three real multiplications

swap two integers without using a temporary variable.