This is a JSFiddle Assignment so this needs to be written at

This is a JSFiddle Assignment so this needs to be written at jsfiddle.net with the HTML and Java scriptincluded

You are going to create a Queue. (alternately you can create a list and simply implement enqueue and dequeue functions in the List - that will technically make it a queue). You will fill the first list with numbers consecutively numbered from 2 to n where n is entered by the user (we will call this Q1). When creating your Queue object use the correct function names for enqueue and dequeue functions. Again - sorry, cannot use an Javascript array in your implementation - you need to implement enqueue and dequeue.

Create a second empty Queue Q2.

Once you have the first Queue filled we are going to use a technique called Sieve of Eratosthenes which uses first queue to fill the second queue. You will need to look at the algorithm for this https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes

Here is the algorithm;

1. Dequeue 1st element in Q1 (which will be 2). You will need to remember the value of this element - we will call it X.

2. Enqueue this element into Q2 (Q2 is the list of primes)

3. Iterate and Dequeue each successive element of Q1

     If the value is divisible by X, go to the next element

     if the value is not divisible by X enqueue back onto Q1, go to the next element.

4. Print the values of Q1 and Q2 after each time through.

5. When done go back to the beginning of the Q1 and repeat steps 1-3 (the first value will be 3 the second time around)

Sample output with input 10

Iteration 0: Q1 = 2 3 4 5 6 7 8 9 10, Q2 = ,

Iteration 1: Q1 = 3 5 7 9, Q2 = 2

Iteration 2: Q1 = 5 7, Q2 = 2 3

Iteration 3: Q1 = 7, Q2 = 2 3 5

Iteration 4: Q1 = , Q2 = 2 3 5 7

Solution

Javascript---------------------------------------------

var Queue = function()
{
this.first = null;
this.last = null;
this.size = 0;
};

var Node = function(data)
{
this.data = data;
this.next = null;
};

Queue.prototype.enqueue = function(data)
{
var node = new Node(data);

if (!this.first)
{
    this.first = node;
    this.last = node;
}
else
{
    this.last.next=node;
    this.last=node;
}

this.size += 1;
return node;
};

Queue.prototype.dequeue = function()
{
if (!this.first)
    return null;

temp = this.first;
if (this.first==this.last)
{
    this.last=null;
}
this.first = this.first.next;
this.size -= 1;
return temp;
};