0 0 votes Algorithms time-complexity array algorithm-design + – Deepalitrapti 1.7k views answer comment Share Follow Print See all 13 Comments 13 13 Comments reply Show 10 previous comments air1ankit commented Sep 2, 2018 reply Follow flag Well explanation bro @shaikmasthan 0 0 replyShare Shaik Masthan commented Sep 2, 2018 reply Follow flag we can't apply binary search, due to array is not sort. But we know that n is fixed ===> apply counting sort ==> O(n) then again with a for loop, we can know which is missing ===> O(n) O(n)+O(n) = O(n) 0 0 replyShare mrinmoyh commented Sep 17, 2020 reply Follow flag XOR method is also interesting- https://www.geeksforgeeks.org/find-the-missing-number/ 0 0 replyShare Please log in or register to add a comment.
