sorting in linked list
有一个链表,想对里面number这个element从小到大进行排序,请各位高手帮忙,
文件:
number lastname firstname rate
012452 Wong Andrew 23.56
891756 Simmons Angela 24.94
268174 Tindall Jeremy 18.56
718756 Ting Susan 27.86
261786 Murdock Brian 25.98
这是我的code,可是不work.
void sorting(record **headptr, int number)
{
record *temptr = NULL;
record *prv = NULL;
record *loc = NULL;
record *curr= NULL;
record *pos = NULL;
if (*headptr != NULL)
{
*headptr = temptr;
(*headptr) -> next = prv;
}
while( prv != curr)
{
for (pos = *headptr; pos != NULL; pos++)
{
if( prv->number > curr->number)
{
curr->next = loc;
temptr->next = curr;
curr->next = prv;
prv->next = loc;
}
}
temptr = *headptr;
}
}
文件:
number lastname firstname rate
012452 Wong Andrew 23.56
891756 Simmons Angela 24.94
268174 Tindall Jeremy 18.56
718756 Ting Susan 27.86
261786 Murdock Brian 25.98
这是我的code,可是不work.
void sorting(record **headptr, int number)
{
record *temptr = NULL;
record *prv = NULL;
record *loc = NULL;
record *curr= NULL;
record *pos = NULL;
if (*headptr != NULL)
{
*headptr = temptr;
(*headptr) -> next = prv;
}
while( prv != curr)
{
for (pos = *headptr; pos != NULL; pos++)
{
if( prv->number > curr->number)
{
curr->next = loc;
temptr->next = curr;
curr->next = prv;
prv->next = loc;
}
}
temptr = *headptr;
}
}
...全文
相关推荐
Algorithms in C++, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching
### Algorithms in C++, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching#### Part One: Fundamentals
数据结构_二叉搜索树_双链表_单链表_队列_栈_算法_排序__1741874139.zip
单链表(Singly Linked List)是最简单的链表结构,由一系列节点组成,每个节点包含数据部分和一个指向下一个节点的指针。
Data-Structures-in-Python
例如,`my_list = [1, "two", 3.0]`。2. **元组(Tuples)**: 元组与列表类似,但它是不可变的。
Adam Drozdek_Data Structures and Algorithms In C++_2nd Edition.pdf
**链表(Linked List)** - 链表的基本概念:单向链表、双向链表和循环链表。 - 链表节点的结构设计及其在C++中的实现。
计算机编程及常用术语英语词汇大全.pdf
* 链表(Linked List):一种动态的数据结构,用于存储一组数据,每个数据项都指向下一个数据项。


新手乐园
