Basic Data Structure
$10-30 USD
Paid on delivery
Implement the deque. It should allow the typical operations and an iterator to traverse all items
(the same bidirectional iterator, i.e. allowing ++/-- operations as the one used in a list). Use the
STL for reference on the deque interface, at minimum you need to have the [] (index) operator
and be able to add/remove items from the front/back of the queue, all in O(1) time.
2. Implement a data structure for the sparse matrix. The idea is to allow the usual access as if the
matrix is a 2-d array, but only the non-zero elements are physically saved in the underlying
structure.
3. Do an evaluation of the performances of STL sequence containers (vector, list, deque) in a
simulated real world testing condition (relatively large data set), in typical operations, such as
insertion/deletion/retrieval of items of different sizes (e.g. T being an int vs. T being a structure
taking up 1KB for space). What you'll be measuring is the time as a function of the number of
data elements. Obviously it's dependent on the speed of the computer one uses, so what
matters is the relative speed.
Project ID: #6878379
About the project
Awarded to:
7 freelancers are bidding on average $73 for this job
Hello I am C++ expert and interested in this project. Please communicate to discuss further. Regards Anshu
Hello, I can implement for you in C++ a deque, a sparse matrix and do the performance comparisons required in your description. Thanks and let me know if you are interested to work with me, Paul
I am a C++ programmer with 10+ years of experience. I can implement the deque for you, using the increment/decrement, index operators + usage of iterator. I will deliver in max. 24 hours, most probably even less. Ready More
I have 6 years experience in C/C++ programming. This task is quite simple and can be finish in hours. Please let me help you. Thank you very much!