Find missing integer using divide and conquer

Revision en1, by krazy8, 2021-04-27 20:33:20

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.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English krazy8 2021-04-27 20:33:20 322 Initial revision (published)