Added Xor Basis

[khan-shahnawaz]

Xor basis is an useful technique to solve many complex problems in Competitive Programming involving bitwise xors. This pull request adds code for xor basis.

[bjorn-martinsson]

There is a simpler algorithm for xor basis.

basis = []
def reduce(x):
  for b in basis:
    x = min(x, x ^ b)
  return x

def insert(x):
  x = reduce(x)
  if x:
    basis.append(x)
    return True
  return False

[khan-shahnawaz]

Updated the code. Please have a look

[cheran-senthil]

bit length shouldn't be a parameter

[khan-shahnawaz]

bit length shouldn't be a parameter

Actually it's needed to print xor basis upto certain number of bits. It is anyway optional.

[bjorn-martinsson]

1. I agree with Cheran that bit_length should not be a parameter. If you want a fancy print it would be better to use max(self.basis).bit_length(). But you probably should just remove this completely.
2. Keep __contains__ and remove the function is_redundant. There is no reason to have both, and contains is a nice name for the function.
3. A repr-function should never directly call the print function. Instead it should return a string. One more remark. The comment in repr " Prints the basis in descending order " is wrong. You would need to sort basis for this.