Given an integer n ? 2, develop an efficient algorithm to compute and print all prime numbers between 2 and n. Describe the time complexity of your algorithm.
Convert your algorithm into a properly documented, professional quality PROGRAM
Run your program for n = 10 and print all prime numbers between 2 to n demonstrate that your program produces correct results (properly-labelled output).
Run your program for n = 103, 104, 105, 106, 107, 108, and 109. Use internal clock to print out the time taken by your computer system, and number of primes in each case.
TABULATE YOUR RESULTS (n versus number of primes versus time).
ANALYSE YOUR RESULTS (detailed critical evaluation) from the viewpoint of "Algorithm Design & Analysis” based on the above table and your knowledge of COMP 3050. Use graphs or any other enhancements as necessary.
Write an algorithm and code for converting a binary number to a decimal number. Describe the time complexity of your algorithm. (make your own assumptions)
All this needs to be done in Java. The budget of the project is $30. All this needs to be done exactly the way it's specified. If you have any queries you can contact me anytime