MAXIMUM XOR USING K ELEMENT IN ARRAY

for example

5 3
1
2
3
4
5
 

here no of element=5,k=3; here OUTPUT IS 7 how to approach this type of problm with or without recursion which one is easier source= https://www.spoj.com/problems/CODEIT02/