add method of LinkedSortList

   I'm trying to write an add method for a LinkedSortList class. Can someone explain the algorithm (don't write the code) step-by-step for the add method? The spec is to add an element without changing the order of the list (keeps it in order). The structure to use is linear nodes. I would really appreciate it. Thanks!
Who is Participating?

[Product update] Infrastructure Analysis Tool is now available with Business Accounts.Learn More

I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

You have the list as follows:

You have to add new element "W".
Begin to iterate elements and find position where new element is in relation like:


then you set pointers like:

NEXT.previous = ADDED

so you begin to iterate elements of you current array and you find out that:

A,B - no action
B,D - no action
D,Z - here you take the action: = W
W.previous = D = Z
Z.previous = W

then you have structure:



Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today

From novice to tech pro — start learning today.