单向链表的排序操作？（一道笔试题，请给出程序，要求改变节点的指针，不能只交换值）

[whizstorm]

typedef struct A
{
int data;
A *next;
}

要求根据 data 完成链表的升序？

[meiggy]

template<class T>
node<T>* sortlist(node<T>* &head)
{
assert(head != NULL);
node<T> *first = head;
node<T> *lesscur = NULL;
node<T> *precur;
node<T> *cur = head;
while(cur->next != NULL)
{
precur = cur;
cur = cur->next;
if(cur->data<precur->data)
{
while(cur->data >= first->data)
{
lesscur = first;
first = first->next;
}
if(lesscur == NULL)
{
precur->next = cur->next;
cur->next = first;
head = cur;
cur = precur;
lesscur = NULL;
}
else
{
precur->next = cur->next;
lesscur->next = cur;
cur->next = first;
cur = precur;
lesscur = NULL;
}
first = head;
}
}
return head;
}

[meiggy]

上面node如下：
template<class T>
class node
{
public:
node(const T& x,node* n = 0,node*p = 0):data(x),next(n),pre(p){};
T data;
node* next;
};

[meiggy]

你把node换成你的struct A就行啦