The Sieve of Eratosthenes is an elegant algorithm for finding all the prime numbers up to some limit n. The basic idea is to fir
1 answer:
You might be interested in
Answer:
Following are the code to this question:
Counter T = new Counter(1, 100); //creating Counter class object and call its parameterized constructor
Thread T1 = new Thread(new Runnable() //creating Thread object T1.
{
public void run() //define run method
{
T.countRange(); //call countRange method
}
});
Thread T2 = new Thread(new Runnable() //creating another object "T2" of Thread.
{
public void run() //define run method
{
T.countRange(); //call countRange method
}
});
T1.start(); //start Thread T1
T2.start(); //start Thread T2
Explanation:
Description of the above code as follows:
- In the given code, inside the main method the Counter class object "T" is created, that calls its parameterized constructor, which accepts two integer value that is "1 and 100".
- In the next step, thread class object T1 and T2, is created, which uses run method, in which it called the countRange method inside the method a for loop is declared that prints value between parameter value.
- In the last step, the start method is called, which uses the run method to call countRange method.
- For full program code please find the attachment.
