void sort(TS **h) /* 选择排序算法 */ =====这里为什么会有参数列表错误为什么啊
{
TS *h1,*p,*q,*r,*s;
h1=p=(TS *)malloc(sizeof(TS));
p->next=*h;
while(p->next) {
q=p->next;
r=p;
while(q->next) {
if(q->next->valuenext->value)
r=q;
q=q->next;
}
if(r!=p) {
s=r->next;
r->next=s->next;
s->next=p->next;
p->next=s;
}
p=p->next;
}
*h=h1->next;
free(h1);
}

TS是什么？

要发就要将全部的程序发上来
不然不好分析

nclude<stdio.h>
#include<stdlib.h>
typedef struct STRUCT {
int value;
struct STRUCT *next;
}TS;
main()
{
#define N 9
int a[N],i;
TS *head,*p;
TS *CreateLink(int *,int);
void sort(TS **);
randomize();
for(i=0;ia=random(9);
head=CreateLink(a,N);
for(p=head;p;p=p->next)
printf(“%-2d“,p->value);
putchar(‘\n‘);
sort(&head);
for(p=head;p;p=p->next)
printf(“%-2d“,p->value);
getchar();
}
void sort(TS **h) /* 选择排序算法 */
{
TS *h1,*p,*q,*r,*s;
h1=p=(TS *)malloc(sizeof(TS));
p->next=*h;
while(p->next) {
q=p->next;
r=p;
while(q->next) {
if(q->next->valuenext->value)
r=q;
q=q->next;
}
if(r!=p) {
s=r->next;
r->next=s->next;
s->next=p->next;
p->next=s;
}
p=p->next;
}
*h=h1->next;
free(h1);
}
TS *CreateLink(int *a,int n)
{
int i;
TS *h,*p;
h=NULL;
for(i=n;i>0;i--) {
p=(TS *)malloc(sizeof(TS));
p->value=a[i-1];
p->next=h;
h=p;
}
return h;
}

for()????

// 修改了排序算法
// 使用的随即函数不适标准的，所以用标准的写了两个
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

#define randomize() srand((unsigned int)time(NULL))
#define random(num) (rand() % (num))
/* 与上面的宏相同功能
void randomize(void)
{
    srand((unsigned int)time(NULL));
}

int random(int num)
{
    return rand() % num;
}
*/
#define N 9

typedef struct STRUCT {
    int value;
    struct STRUCT * next;
}TS;


TS * CreateLink(int * a, int n);
void sort(TS * ppHead);

int main(void)
{
    int a[N],
        i;
        
    TS * head,
       * p;

    randomize();
   
    for(i = 0; i < N; i++)
        a[i] = random(9);
        
    head = CreateLink(a, N);
   
    for(p = head; p; p = p->next)
        printf("%-2d", p->value);
        
    putchar('\n');
   
    sort(head);
   
    for(p = head; p; p = p->next)
        printf("%-2d", p->value);

    getchar();
    return 0;
}

void sort(TS * pHead) /* 选择排序算法 */
{
    int temp;
   
    TS *i, *j;
   
    if(pHead == NULL)
        return;

    for(i = pHead; i->next != NULL; i = i->next)
    {
        for(j = i->next; j != NULL; j = j->next)
        {
            if(i->value > j->value)
            {
                temp = i->value;
                i->value = j->value;
                j->value = temp;
            }
        }
    }
}

TS *CreateLink(int * a, int n)
{
    int i;
    TS * h, * p;
    h = NULL;
    for(i = n; i > 0; i--)
    {
        p=(TS *)malloc(sizeof(TS));
        p->value=a[i-1];
        p->next=h;
        h=p;
    }
    return h;
}

[[it] 本帖最后由 cosdos 于 2008-9-6 22:44 编辑 [/it]]