Problem trying to prove: deleteNode of NumberList is faster than

Added on - 16 Sep 2019

  • 1

    pages

  • 101

    words

  • 142

    views

  • 0

    downloads

Showing pages 1 to 1 of 1 pages
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 bothNumberList 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 belowConclusion– Yes, my hypothesis was correct, I got results which supports it.
desklib-logo
You’re reading a preview
card-image

To View Complete Document

Become a Desklib Library Member.
Subscribe to our plans

Unlock This Document