#ENQUEUE JAVASCRIPT ALGORIGHTM CODE#
You should only use this code as a reference. There are many more, and if you plan to do algorithmic programming, these are worth investigating – Īn online search will yield a lot of implementations of the Sieve (it is used a lot). The Sieve of Eratosthenes is one of the methods for creating a prime list. You must then use your queues in the Erasthones algorithm for the remaining half credit. You may want to note that these may already be written and simply need this new name.Īssignment Grading Criteria – You must implement a working Queue with both enqueue and dequeue functions for grading, this is worth half credit. This is by simply adding the function enqueue and dequeue. You MUST use your Link/Stack code and extend it to this algorithm. 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) Print the values of Q1 and Q2 after each time through.ĥ. If the value is not divisible by X enqueue back onto Q1, and go to the next element.Ĥ. If the value is divisible by X, go to the next element Iterate and Dequeue each successive element of Q1 Enqueue this element into Q2 (Q2 is the list of primes)ģ. You will need to remember the value of this element – we will call it X.Ģ. Dequeue 1st element in Q1 (which will be 2). You will need to look at the algorithm for this ġ. Once you have the first Queue filled, we will use a technique called Sieve of Eratosthenes, which uses the first queue to fill the second queue. You cannot use a Javascript array in your implementation – you must implement enqueue and dequeue. When creating your Queue object, use the correct function names for enqueue and dequeue functions.
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). (alternately, you can create a list and simply implement enqueue and dequeue functions in the List – that will technically make it a queue). The Queue is a pretty straightforward concept (everyone has stood in line before). Start by going through Topic – Stacks and Queues if you have not already done so. Implement data structures and algorithms in computer code. Select the correct data structure and algorithm to solve specific problems.ģ. Describe both complex and simple data structures.Ģ. Implement the Queue Data Structure and use it to implement a complex algorithmġ.
0 kommentar(er)
