Question

I need you guys help with my Java Class( use netbean if you can, thank a lot ). Please help me out, I may need full working code

Question:

An array A contains n−1 unique integers in the range [0,n−1], that is, there is one number from this range that is not in A. Design an O(n)-time algorithm for
finding that number. You are only allowed to use O(1) additional space besides the array A itself.

DO NOT SORT THE ARRAY. Must provide a test application with at least 2 sets of numbers. Hint: find smallest, largest, and sum. Compare the sum with the series summation.

Answer 1

Algorithm:

1. Get the sum of numbers 
       total = n*(n+1)/2
2  Subtract all the numbers from sum and
   you will get the missing number.

CODE

// Java program to find missing Number

public class Main

{

// Function to find missing number

static int getMissingNo (int a[], int n)

{

int i, total;

total = (n) * (n + 1) / 2;

for ( i = 0; i< n; i++)

total -= a[i];

return total;

}

/* program to test above function */

public static void main(String args[])

{

int a[] = {0, 1, 2, 4, 5};

int miss = getMissingNo(a,5);

System.out.println(miss);

}

}

​​​​​​​

3 public class Main 5 Function to find missing number 6 static int getMissingNo (int a[, int n) int i, total; total-(n) * (n +1)/ 2; for 0; i< n; i++) 10 total ail 12 13 14 15 16 public static void main(String args) 17 18 19 20 21 return total; *program to test above function int a-0, 1, 2, 4, 5; int miss -getMissingNo(a,5); System.out.println(miss); 23 ? Problems @ Javadoc 3 Declaration ApSearch Cons sterminated> StackListBased [Java Application] /Library/Java/JavaV