Given an array of size n-1 filled with elements from 1 to n with one missing number. Find that missing number using divide and conquer.
I google it and found many binary search algorithms but couldn't find any divide and conquer approach. Anybody know how to solve it.