Int Chain <T>::Search (const T& x) const
ChainNode <T> *current=first;
Int index=1;
Int key=1;
While (current->link !=NULL)
{
if(current->data > (current->link)->data)
{
key=index;
}
current=current->link;
index++
}
if (current) return key;
return 0;