新手笔记-简单的排序练习

#include <string.h>
#include <stdio.h>
struct person{
char *name;
int score;
};

int init(struct person *p, char *name, int score)
{
p->name = name;
p->score = score;
}

int find_max(struct person *p)
{
int i, j;
int max = p->score;
for(i=0; i<6; i++)
{
if((p+i)->score > max)
max = (p+i)->score;
}

return max;
}

int sort(struct person *p)
{
int i=0, j=0, max=0, maxi=0, k=0;
char *arr;
for(i=0; i<6; i++)
{
maxi=i;
max = (p+i)->score;
for(j=i+1; j<6; j++)
{
if((p+j)->score > max)
{
max = (p+j)->score;
maxi = j;
}
}
arr = (p+i)->name;
(p+i)->name = (p+maxi)->name;
(p+maxi)->name = arr;

k = (p+i)->score;
(p+i)->score = (p+maxi)->score;
(p+maxi)->score = k;

printf("sss is %d \n", (p+i)->score);
}

}

int sort1(struct person *p)
{
int i, j, k, m;
char *arr;

for(i=0; i<6; i++)
{
for(j=i+1; j<6; j++)
{
m = strcmp((p+i)->name , (p+j)->name);
if(m > 0)
{
arr = (p+i)->name;
(p+i)->name = (p+j)->name;
(p+j)->name = arr;

k = (p+i)->score;
(p+i)->score = (p+j)->score;
(p+j)->score = k;
}
}

sss is 98
sss is 88
sss is 79
sss is 67
sss is 65
sss is 60
tom , 98
jams , 88
jim , 79
lucy , 67
tubi , 65
suoluo , 60
jams , 88
jim , 79
lucy , 67
suoluo , 60
tom , 98
tubi , 65
avg is 76
max is 98