CS 3300 structure has the fastest Delete operation

CS 3300
Paper 1 – Linked List vs Vector
Due Before: Monday, September 28th, 11:30 p.m.
Instructions:
Which data structure has the fastest Delete operation? For this paper, you will compare the following
delete operations:
1. void LinkedList<T>::deleteNode(T searchValue)
a. This is the Gaddis Linked List class template ( LinkedList.h not NumberList.h )
2. Standard Template Library – Vector .erase()
a. This is the definition found in the stl vector header file (#include <vector>).
3. Standard Template Library – List .erase()
a. This is the definition found in the stl list header file (#include <list>).
Turn in an algorithm that can be used to answer the above question.
Paper requirements:
1. List the steps of the algorithm in the form of an outline (not paragraphs).
2. The algorithm needs to have at least 3 loops. For each loop define:
a. What will cause the loop to end?
b. What work is done during each loop iteration?
3. The paper needs to be done individually.
4. This paper needs to be saved in one of the following file formats: .doc, .docx, or .pdf.
5. Turn in your paper via the Blackboard dropbox for Paper 1.
6. If you used any references, you will need to include a Works Cited page. You can choose any
format for this page.
Notes:
You can include figures in your paper as long as you:
1. Label the figures
2. Refer to them within your algorithm
3. Cheating will result in a grade of F in the course. Cheating includes using code that has
been posted to websites such as but not limited to chegg or coursehero. Your
instructor will be checking these websites for code similarity prior to grading your work.
Algorithm Design Link:
https://www.tutorialspoint.com/data_structures_algorithms/algorithms_basics.htm
[Refer to the Next Page for an Example]
Your name
CS 3304
Paper 1
Linked List vs Vector
[List the steps in the form of an outline.]
Works Cited Page (Optional)

AssignmentTutorOnline