code:
-----
public void add(int key, T value)
{
Link previous = null; // start at first
Link current = first;
// until end of list,
while( current != null && key > current.getKey() )
{ // or current > key,
previous = current;
current = current.next; // go to next item
}
if(previous==null) // if beginning of list,
first = theLink; // first --> new link
else // not at beginning,
previous.next = theLink; // prev --> new link
theLink.next = current; // new link --> current
}
Pseudo code:
------------
1. start from first node
Link current=first;
2. Traverse the hash table till the end of the list and
the key value becomes greater than the current key value,
and locate a position,called previous.
3. If the obtained position is null, make the new node as
first node. Place the value in that node.
4. if the position is not null,insert the new node as next
to previous node.
Solution
code:
-----
public void add(int key, T value)
{
Link previous = null; // start at first
Link current = first;
// until end of list,
while( current != null && key > current.getKey() )
{ // or current > key,
previous = current;
current = current.next; // go to next item
}
if(previous==null) // if beginning of list,
first = theLink; // first --> new link
else // not at beginning,
previous.next = theLink; // prev --> new link
theLink.next = current; // new link --> current
}
Pseudo code:
------------
1. start from first node
Link current=first;
2. Traverse the hash table till the end of the list and
the key value becomes greater than the current key value,
and locate a position,called previous.
3. If the obtained position is null, make the new node as
first node. Place the value in that node.
4. if the position is not null,insert the new node as next
to previous node..
Transparency, Recognition and the role of eSealing - Ildiko Mazar and Koen No...
code ----- public void add(int key, T value) { Link previou.pdf
1. code:
-----
public void add(int key, T value)
{
Link previous = null; // start at first
Link current = first;
// until end of list,
while( current != null && key > current.getKey() )
{ // or current > key,
previous = current;
current = current.next; // go to next item
}
if(previous==null) // if beginning of list,
first = theLink; // first --> new link
else // not at beginning,
previous.next = theLink; // prev --> new link
theLink.next = current; // new link --> current
}
Pseudo code:
------------
1. start from first node
Link current=first;
2. Traverse the hash table till the end of the list and
the key value becomes greater than the current key value,
and locate a position,called previous.
3. If the obtained position is null, make the new node as
first node. Place the value in that node.
4. if the position is not null,insert the new node as next
to previous node.
Solution
code:
-----
public void add(int key, T value)
2. {
Link previous = null; // start at first
Link current = first;
// until end of list,
while( current != null && key > current.getKey() )
{ // or current > key,
previous = current;
current = current.next; // go to next item
}
if(previous==null) // if beginning of list,
first = theLink; // first --> new link
else // not at beginning,
previous.next = theLink; // prev --> new link
theLink.next = current; // new link --> current
}
Pseudo code:
------------
1. start from first node
Link current=first;
2. Traverse the hash table till the end of the list and
the key value becomes greater than the current key value,
and locate a position,called previous.
3. If the obtained position is null, make the new node as
first node. Place the value in that node.
4. if the position is not null,insert the new node as next
to previous node.
