Ask a question from expert

Ask now

Problem trying to prove: deleteNode of NumberList is faster than

1 Pages101 Words329 Views
   

Added on  2019-09-16

Problem trying to prove: deleteNode of NumberList is faster than

   Added on 2019-09-16

BookmarkShareRelated Documents
Problem trying to prove: deleteNode of NumberList is faster than stl list.Hypothesis – I believe NumberList deleteNode is faster than STL erase.Experiment – I have taken three sample data size 20000, 30000 and 50000. I have created both NumberList and STL list with these data sets. After that I have delete all the data in those lists.Results – In all the test cases, delete in NumberList was faster than STL list. See below Conclusion – Yes, my hypothesis was correct, I got results which supports it.
Problem trying to prove: deleteNode of NumberList is faster than_1

End of preview

Want to access all the pages? Upload your documents or become a member.

Related Documents
Write a program in C++ to reach a conclusion as to whether or
|2
|485
|494

Programming, Algorithms and Data Structure: Weekly Tasks and Exercises
|2
|501
|348

Consent Form for Functional Analyzes of Campaign Management in Saralrozgar
|2
|630
|201

Person's Correlation and Chi Square Test Question Answer 2022
|4
|674
|25

Thesis Title Assessment 2022
|9
|36095
|15

The Basic Practice of Statistics Assignment
|4
|442
|21