链表插入排序

原创于 2012-01-31 16:17:12 发布 · 332 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#list #null

C/C++基础专栏收录该内容

48 篇文章

订阅专栏

本文介绍了一个基于链表实现的插入排序算法。该算法通过比较节点长度来决定排序顺序，并将待排序元素插入到适当位置。文章详细展示了插入排序的具体实现过程及节点计数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

void insertsort(List &SortAsCount,Node * node)
{
Node *q = new Node;
q->count = node->count;
q->data = node->data;
q->len = node->len ;
if(SortAsCount.first == NULL)
SortAsCount.first = q;
else{
if(q->len <= SortAsCount.first->len ){
q->next = SortAsCount.first;
SortAsCount.first = q;
}
else{
Node *p_prior,*p = SortAsCount.first;


while(p != NULL && q->len > p->len ){
p_prior = p;
p = p->next;
}
p_prior->next = q;
q->next = p;
}


}

}


int SortWithInsetMethod(List &SortAsData)
{
unsigned int countword(0);
for(int i = 0 ; i <Arr_Length ; i++){
Node *p = MyList[i].getfirst();
p = p->next;
while(p){
if(p->count == 0){
p = p->next;
continue;
}
wchar *pp = p->data;
/*if(isNum(*pp)){
p = p->next;
continue;

}*/
int i = 0;
i = p->count ;
insertsort(SortAsData,p);
countword = countword + p->count;
p = p->next;
 
} 
}


printf("%s%d\n","the number of words is :",countword);
return countword;


}