时隔许久,,,
两种常规排序,程序已测试
#include<stdio.h>
#include<string.h>
#define N 5
typedef struct
{
char name[10];
char num[13];
}users;
void bubblesort(users *user,int length);
void selectsort(users *user,int length);
void printarr(users *user,int length);
int main()
{
users user[N] = {
{"zhangsan","1234567"},{"lisi","2345678"},
{"wangwu","12398746"},{"abc","123467890"},{"chenliu","d345123"}};
// bubblesort(user,N);//冒泡排序
selectsort(user,N);//选择排序
printarr(user,N);
return 0;
}
void bubblesort(users *user,int length)
{
int i,j,tag;
users temp;
for(i=0;i<length-1;i++)
{
tag = 1;//冒泡改进
for(j=0;j<length-i-1;j++)
{
if(strcmp(user[j].name,user[j+1].name)>0)
{
temp = user[j];
user[j] = user[j+1];
user[j+1] = temp;
tag