Java

Question 4: Explaination

You are suppose to create a boolean array which will have a size equal to the maximum element in the array (that already contains some elements) and mark only those positions in the boolean array which are present in the given array. Print all the index in the boolean array that are not marked. Below are the steps:

Simplified form of Algorithm

1. Initialize a boolean array counter[] with zero of size equals to the size of array A[].

2. At first, iterate over the given array A[] and mark for each element in the given array mark that index as true in the array counter[].

3. Now traverse the counter[] from index [0] and print those index whose value is false as they are the element that is missing in the given array

Q4. Consider the following algorithm for the problem to find missing numbers in an integer array with duplicates. Array may contain more than one duplicate value. Require: Missing numbers from the Array Ensure: Integer Array having duplicate values Set counter = len(Ensure) int i = Ensure set counter = 1 for all given numbers in Array while i