Been coding away today decided that i would update an old program i did a while ago which was the base of an organisor application.
So today i converted it to use STL instead of my hardcoded double linked class. I used list<> as my original implimentation was a double linked list, and vector<>. using the generic sort algorithm. The sort time using a vector for a few hundred objects wasn't too bad. However with the list implimentation it took nearly a second to sort.
Is this normal? considering by comparison my hard coded sort routine did the work in 0.002 seconds (its a big change i know)
So what i would like is can anyone offer some knowledge of what they would expect or if it suggests my hand coded routine is possibly flawed?
I have attached my project files to this if anyone wants a look at what i have done to see if its me and not STL who is to blame. (im using VS2008 but not using any VS specific code)
My next step is considering the speed of my algorithm to see if i make it flexable and then see if it is still faster. All i can reasonably assume right now is that due to the fact that the STL is so felxable they can't do things as convienantly as i can as i have exact knoweladge of the class im sorting.
Any and all comments welcome.