Problem trying to prove: deleteNode of NumberList is faster than
Added on -2019-09-16
| 1 pages
| 101 words
| 329 views
Trusted by 2+ million users, 1000+ happy students everyday
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.
Found this document preview useful?
You are reading a preview Upload your documents to download or Become a Desklib member to get accesss