Thread: Whoa, are reverse iterators slower and should I really care?

Hello All,

I have some code where I need to iterate backwards through a vector.

I thought about writing this with random access iterators and just subtracting one until I got to the beginning but then I looked it up and there are STL implemented reverse iterators so I just used those and they work perfectly for my needs.

But I looked up if they were slower and the google searches seem to indicate yes.

Granted, I'm only reverse iterating through like 4 elements at a maximum but I'm doing it quite a bit so I'm just curious, should I even care about using reverse iterators just long as they do the job properly?