一.选择排序
思路:
代码:
void selectSort() {
for(int i = 1 ; i <= n ; i ++) {
int k = i ;
for(int j = i ; j <= n ; j ++) {
if(A[j] < A[k]) k = j ;
}
int temp = A[i] ;
A[i] = A[k] ;
A[k] = temp ;
}
}
二.插入排序
思路:
代码:
void insertSort() {
for(int i = 2 ; i <= n ; i ++) {
int temp = A[i] ;
int j = i ;
while(j > 1 && temp < A[j - 1]) {
A[j] = A[j - 1] ;
j -- ;
}
A[j] = temp ;
}
}
三.排序题与 sort 函数的应用
思路:
1.结构体;
2.cmp函数;
bool cmp(Student a , Student b) {
if(a.score != b.score) return a.score > b.score ;
else return strcmp(a.id , b.id) < 0 ;
}
strcmp函数:strcmp(a , b)且a、b是 char 类型,比较字典序:若a<b,返回 <0 的数;a>b,返回 >0 的数;a=b,返回0;
3.排名的实现
1).记录入结构体:
stu[0].r = 1 ;
for(int i = 1 ; i < n ; i ++) {
if(stu[i].score == stu[i - 1].score) stu[i].r = stu[i - 1].score ;
else stu[i] = i + 1 ; //在stu[i]前的数的个数即为排名
}
2).直接输出
int r = 1 ;
for(int i = 0 ; i < n ; i ++) {
if(stu[i].score != stu[i - 1].score) r = i + 1 ;
printf("%s %d",stu[i].id,stu[i].r) ;
}
题目:
1.PAT A1025:
思路:
1).保存考场内排名 location_rank,直接输出全部排名;
2).如何写循环条件:sum - num ~ sum;
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std ;
struct Student {
char id[15] ;
int score ;
int location_number ;
int local_rank ;
} stu[30010] ;
bool cmp(Student a , Student b) {
if(a.score != b.score) return a.score > b.score ;
else return strcmp(a.id , b.id) < 0 ;
}
int main() {
int n ;
scanf("%d",&n) ;
int sum_num = 0 ;
for(int j = 1 ; j <= n ; j ++) {
int num ;
scanf("%d",&num) ;
sum_num += num ;
for(int i = sum_num - num ; i < sum_num ; i ++) {
scanf("%s %d",stu[i].id,&stu[i].score) ;
stu[i].location_number = j ;
}
sort(stu + sum_num - num , stu + sum_num , cmp) ;
stu[sum_num - num].local_rank = 1 ;
for(int i = sum_num - num + 1 ; i < sum_num ; i ++) {
if(stu[i].score == stu[i - 1].score) stu[i].local_rank = stu[i - 1].local_rank ;
else stu[i].local_rank = i + 1 - sum_num + num ;
}
}
sort(stu , stu + sum_num , cmp) ;
int rank = 1 ;
printf("%d\n",sum_num) ;
printf("%s 1 %d %d\n",stu[0].id,stu[0].location_number,stu[0].local_rank) ;
for(int i = 1 ; i < sum_num ; i ++) {
if(stu[i].score != stu[i - 1].score) rank = i + 1 ;
printf("%s %d %d %d\n",stu[i].id,rank,stu[i].location_number,stu[i].local_rank) ;
}
return 0 ;
}
2.PAT A1062
思路:
本题的关键在于写 cmp 函数,在结构体内保存类别,在cmp函数中按照类别从小到大排序;
代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std ;
struct Student {
char id[10] ;
int dscore ;
int cscore ;
int sum ;
int flag ;
}stu[100010] ;
bool cmp(Student a , Student b) {
if(a.flag != b.flag) return a.flag < b.flag ;
else if(a.sum != b.sum) return a.sum > b.sum ;
else if(a.dscore != b.dscore) return a.dscore > b.dscore ;
else return strcmp(a.id , b.id) < 0 ;
}
int main() {
int N , L , H ;
scanf("%d%d%d",&N,&L,&H) ;
int m = N ;
for(int i = 0 ; i < N ; i ++) {
scanf("%s%d%d",stu[i].id,&stu[i].dscore,&stu[i].cscore) ;
stu[i].sum = stu[i].dscore + stu[i].cscore ;
if(stu[i].dscore < L || stu[i].cscore < L) {
m -- ;
stu[i].flag = 5 ;
}
else if(stu[i].dscore >= H && stu[i].cscore >= H) stu[i].flag = 1 ;
else if(stu[i].dscore >= H && stu[i].cscore < H) stu[i].flag = 2 ;
else if(stu[i].dscore >= stu[i].cscore) stu[i].flag = 3 ;
else stu[i].flag = 4 ;
}
sort(stu , stu + N , cmp) ;
printf("%d\n",m) ;
for(int i = 0 ; i < m ; i ++) printf("%s %d %d\n",stu[i].id,stu[i].dscore,stu[i].cscore) ;
return 0 ;
}