#include #include void PartOne() ( // 1A // PROPERLY SET UP VECTOR a WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..., 500000 // PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE VECTOR std::vector a; // 10 // PROPERLY SET UP DEQUE b WITH Seeeee ELEMENTS IN ORDER 1, 2, 3, 4, // PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE DEQUE std::dequecint> b; // // 10 // FULLY DESCRIBE WHICH OF THE TWO OPERATIONS IS FASTER THAN THE OTHER AND WHY // EITHER USE A COMMENT, OR PRINT YOUR DESCRIPTION TO THE SCREEN // UP TO 5 POINTS (MAXIMUM 10 OVERALL) EXTRA CREDIT IF YOU CAN SHOW EVIDENCE OF // YOUR DESCRIPTION USING C++ CODE } void PartTwo() { // // 2A // SET UP VECTOR a WITH 500eeе ELEMENTS IN ORDER 1, 2, 3, 4, // PUT EACH ELEMENT IN THE BACK AS YOU ADD THEM TO THE VECTOR 11 500000 500000
#include #include void PartOne() ( // 1A // PROPERLY SET UP VECTOR a WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..., 500000 // PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE VECTOR std::vector a; // 10 // PROPERLY SET UP DEQUE b WITH Seeeee ELEMENTS IN ORDER 1, 2, 3, 4, // PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE DEQUE std::dequecint> b; // // 10 // FULLY DESCRIBE WHICH OF THE TWO OPERATIONS IS FASTER THAN THE OTHER AND WHY // EITHER USE A COMMENT, OR PRINT YOUR DESCRIPTION TO THE SCREEN // UP TO 5 POINTS (MAXIMUM 10 OVERALL) EXTRA CREDIT IF YOU CAN SHOW EVIDENCE OF // YOUR DESCRIPTION USING C++ CODE } void PartTwo() { // // 2A // SET UP VECTOR a WITH 500eeе ELEMENTS IN ORDER 1, 2, 3, 4, // PUT EACH ELEMENT IN THE BACK AS YOU ADD THEM TO THE VECTOR 11 500000 500000
#include #include void PartOne() ( // 1A // PROPERLY SET UP VECTOR a WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..., 500000 // PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE VECTOR std::vector a; // 10 // PROPERLY SET UP DEQUE b WITH Seeeee ELEMENTS IN ORDER 1, 2, 3, 4, // PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE DEQUE std::dequecint> b; // // 10 // FULLY DESCRIBE WHICH OF THE TWO OPERATIONS IS FASTER THAN THE OTHER AND WHY // EITHER USE A COMMENT, OR PRINT YOUR DESCRIPTION TO THE SCREEN // UP TO 5 POINTS (MAXIMUM 10 OVERALL) EXTRA CREDIT IF YOU CAN SHOW EVIDENCE OF // YOUR DESCRIPTION USING C++ CODE } void PartTwo() { // // 2A // SET UP VECTOR a WITH 500eeе ELEMENTS IN ORDER 1, 2, 3, 4, // PUT EACH ELEMENT IN THE BACK AS YOU ADD THEM TO THE VECTOR 11 500000 500000
Every data structure that we use in computer science has its weaknesses and strengths Having a full understanding of each will help make us better programmers! For this experiment, let's work with STL vectors and STL deques Full requirements descriptions are found in the source code file
Part 1 Work with inserting elements at the front of a vector and a deque (30%)
Part 2 Work with inserting elements at the back of a vector and a deque (30%)
Part 3 Work with inserting elements in the middle, and removing elements from, a vector and a deque (40%)
Please make sure to put your code specifically where it is asked for, and no where else Do not modify any of the code you already see in the template file
This C++ source code file is required to complete this problem
Quantities that have magnitude and direction but not position. Some examples of vectors are velocity, displacement, acceleration, and force. They are sometimes called Euclidean or spatial vectors.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.