Sort by:
LikesFiltered by tag: algorithm
|
11
12
Bit Pair Swap
In one line of C or Java, how would you swap every pair of bits in a byte? That is, swap bits 0 and 1, 2 and 3, 4 and 5, 6 and 7.
Example: 0110 1010 becomes 1001 0101.
|
Doable
|
|
3
3
Products Algorithm
Given an array A[1...N] of integers, create an array O[1...N] where O[i] = the product of all elements in A except for the ith element.
For example, if N = 3, and A = {6, 4, 2}, O = {8, 12, 24}
The t
...
|
Doable
|