Hey guys just wondering if someone could help me by just giving me some simple pseudocode to produce an algorithm.
For example if i have values
1
2
4
5
How would i implement the value 3 after the value 2 so that it is in order using a linked list example.
So how would i insert the node in between the other nodes?
Firstly, you would find where the number fits. If it's 3: I think something like if it's greater than 1, 2 the loop should stop before 4 and insert the node after 2->next.
read i
for k=0; k<=i ++i
k=k->next
--------------------
then insert the i after k
you have just to adjust the ->s. Its like this
k->next->prev=i
i->next=k->next
k->next=i
i->prev=k
AC/DC: Highway to Hell!No speed limit, no stop signs, nobody 's gonna slow me down!
