I'm developing a doubly linked list. Now the way I'm currently navigating it is by using a current position pointer, that starts at the tail and then loops round however many times you need (you'll tell the function) and it will then get to that node.
Now, I'm having to do this many times.. when I want to look at a certain index, when I want to delete an item at a certain index, inserting, etc etc etc..
Is there a more efficient way of doing this? Or is this just how it's typically done?
Many Thanks! :)