void myquicksort( node *phead, node *pback )
{
if( phead == pback )
{
return;
}
else
{
int key = phead->data ;
node *p1 = NULL;
for( node *p2 = phead->pNext; p2 != pback; p2 = p2->pNext )
{
if( p2->data < key )
{
p1 = p1->pNext;
int temp;
temp = p1->data;
p1->data = p2->data;
p2->data = temp;
}
}
int temp;
temp = p1->data;
p1->data = phead->data;
phead->data = temp;
myquicksort( phead, p1 );
myquicksort( p1->pNext, pback );
}
}