Question: 1. Write a method to determine if a positive integer, N, is prime in O( N). 2. Given a list of numbers from [1-100] with
1. Write a method to determine if a positive integer, N, is prime in O( N).
2. Given a list of numbers from [1-100] with one number missing, determine which number is missing in O(N) time using basic arithmetic and a max of two new variables The original list does not count as one of the two variables.
(Java Pleas)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
