Register

How to find missing integer from an array on n elements

• retagged by
284 views

1 Answer

0 votes
0 votes
If we use Hashing to store the array,then any number can be found in O(1).
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
dhruba asked Jun 5, 2023
1,163 views
Binary search is performed on a sorted array of n elements. The search key is not in the array and falls between the elements at positions m and m+1 (where 1 ≤ m < n). How many comparisons are needed in the worst case scenario to determine that the key is not in the array?
Binary search is performed on a sorted array of n elements. The search key is not in the array and falls between the elements at positions m and m+1 (where 1 ≤ m < n). ...
User Avatar
0 votes
0 votes
1 answer
2
dhruba asked Jun 5, 2023
452 views
Consider performing QuickSort on an array of n distinct elements. What is the probability that no comparisons will be made between the smallest and largest element?
Consider performing QuickSort on an array of n distinct elements. What is the probability that no comparisons will be made between the smallest and largest element?a. 1/n...
User Avatar
1 votes
1 votes
1 answer
3
radha gogia asked Jul 8, 2016
1,194 views
Given an integer ‘K’ and a tree in string format. We have to print the sum of all elements at Kth level from root.
0 / \ 5 7 / \ / \ 6 4 1 3 \ 9Tree given in the form: (node value(left subtree)(right subtree))For tree given above: (0(5(6()())(4()(9()())))(7(1()())(3()())))Input forma...
User Avatar
0 votes
0 votes
1 answer
4
radha gogia asked Mar 7, 2016
794 views
We are given n keys and an integer k such that 1<=k<=n.Give an efficient algo to find any one of the k smallest keys .
How many key comparisons are there , what is the lower bound and upper bound ? For calculating the lower bound , should we consider the case when the keys are all in non-...
User Avatar
Link Copied!