Program to find greatest prime number in n numbers?
Answer Posted / rajani nagandla
Sorry. initialize i=2 directly as 2 is the first prime
number.. no need of checking for 1.
| Is This Answer Correct ? | 10 Yes | 3 No |
Post New Answer View All Answers
What must a class do to implement an interface in java programming?
Explain java coding standards for variables ?
What are wrapper classes in java?
Why is the type for real numbers called double?
What is meant by data hiding/encapsulation?
Can we make main() thread as daemon?
Can java inner class be static?
Which eclipse is best for java?
Explain the purpose of garbage collection in Java?
What does t in java mean?
How java enabled high performance?
What is a bufferedreader?
Write an algorithm program in java for the following question.. In a VLSI design techniques,they used rectangles to design circuits. EVery rectangle is to be placed according to x,y coordinates. Check whether or not two rectangles overlap each other. Here overlapping of rectangles is acceptable, if 1) one rectangle intersect with other. 2) one rectangle fully covers other. The time of algorithm should not exceed o(n logn).
What is the relationship between clipping and repainting under awt?
Which is faster string or stringbuilder?