本节目录
4.1.1 选择排序
//4_1_1
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;
}
}
4.1.2 插入排序
//4_1_2
int A[maxn],n;//n为元素个数,数组下标为1~0
void insertSort(){
for(int i=2;i<=n;i++){//n-1趟比较
int temp =A[i],j=i;
while (j>1&&temp<A[j-1]){//实现“插入”不断将比这趟主角元素小的元素“向后移动”确定插入位置
A[j]=A[j-1];
j--;
}
A[j]=temp;//将元素插入
}
}
4.1.3 排序题与sort函数应用
A.sort()函数
a1.如何使用sort排序
如果不填写比较函数的参数,则默认进行递增排序
//4_1_3 int数组排序
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
int a[6]={9,4,2,5,6,-1};
//将a[0]~a[3]从小到大排序
sort(a,a+4);
for(int i=0;i<6;i++){
printf("%d ",a[i]);
}
printf("\n");
//将a[0]~a[5]从小到大排序
sort(a,a+6);
for(int i=0;i<6;i++){
printf("%d ",a[i]);
}
return 0;
}
//4_1_4 double数组排序
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
double a[]={1.4,-2.1,9};
sort(a,a+3);
for(int i=0;i<3;i++){
printf("%.1f ",a[i]);
}
return 0;
}
//4_1_5 char型数组(字典序)
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
char c[]={'T','W','A','K'};
sort(c,c+4);
for(int i=0;i<4;i++){
printf("%c",c[i]);
}
return 0;
}
a2.如何实现比较函数cmp
(1)基本数据类型的数组排序
//4_1_6
#include<algorithm>
using namespace std;
int main(){
int a[5]={3,1,4,2};
sort(a,a+4);
for(int i=0;i<4;i++){
printf("%d",a[i]);
}
return 0;
}
//4_1_7
#include<stdio.h>
#include<algorithm>
using namespace std;
bool cmp(int a,int b){
return a>b;
}
int main(){
int a[]={3,1,4,2};
sort(a,a+4,cmp);
for(int i=0;i<4;i++){
printf("%d ",a[i]);
}
return 0;
}
//4_1_8
#include<stdio.h>
#include<algorithm>
using namespace std;
bool cmp(double a,double b){
return a>b;
}
int main(){
double a[]={1.4, -2.1, 9};
sort(a,a+3,cmp);
for(int i=0;i<3;i++){
printf("%.1f ",a[i]);
}
return 0;
}
//4_1_9
#include<stdio.h>
#include<algorithm>
using namespace std;
bool cmp(char a,char b){
return a>b;
}
int main(){
char c[]={'T','W','A','K'};
sort(c,c+4,cmp);
for(int i=0;i<4;i++){
printf("%c",c[i]);
}
return 0;
}
(2)结构体数组的排序
//4_1_10
#include<stdio.h>
#include<algorithm>
using namespace std;
struct node{
int x, y;
}ssd[10];
bool cmp(node a,node b){
return a.x>b.x;
}
int main(){
ssd[0].x=2;
ssd[0].y=2;
ssd[1].x=1;
ssd[1].y=3;
ssd[2].x=3;
ssd[2].y=1;
sort(ssd,ssd+3,cmp);
for(int i=0;i<3;i++){
printf("%d %d\n",ssd[i].x,ssd[i].y);
}
return 0;
}
//4_1_11
#include<stdio.h>
#include<algorithm>
using namespace std;
struct node{
int x, y;
}ssd[10];
bool cmp(node a,node b){
if(a.x!=b.x){return a.x>b.x;}
else{return a.y>b.y;}
}
int main(){
ssd[0].x=2;
ssd[0].y=2;
ssd[1].x=1;
ssd[1].y=3;
ssd[2].x=2;
ssd[2].y=1;
sort(ssd,ssd+3,cmp);
for(int i=0;i<3;i++){
printf("%d %d\n",ssd[i].x,ssd[i].y);
}
return 0;
}
(3)容器的排序
//4_1_12
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
bool cmp(int a,int b){
return a>b;
}
int main(){
vector<int>vi;
vi.push_back(3);
vi.push_back(1);
vi.push_back(2);
sort(vi.begin(),vi.end(),cmp);//对整个vector排序
for(int i=0;i<3;i++){
printf("%d ",vi[i]);
}
return 0;
}
//4_1_13
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
string str[3]={"bbbb","cc","aaa"};
sort(str,str+3);
for(int i=0;i<3;i++){
cout<<str[i]<<endl;
}
return 0;
}
//4_1_14
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
bool cmp(string str1,string str2){
return str1.length()<str2.length();
}
int main(){
string str[3]={"bbbb","cc","aaa"};
sort(str,str+3,cmp);
for(int i=0;i<3;i++){
cout<<str[i]<<endl;
}
return 0;
}
B.相关结构体的定义
struct Student{
char name[100];
char id[10];
int score;
int r;
}stu[100010];
C.cmp函数的编写
bool cmp(Student a,Student b){
if(a.score!=b.score) return a.score>bscore;
else return strmp(a.name,b.name)<0;
}
D.排名的实现
stu[0].r=1;
for(int i=1;i<n;i++){
if(stu[i].score==stu[i-1].score){
stu[1].r=stu[i-1].r;
}else{
stu[i].r=i+1;
}
}
int r=1;
for(int i=0;i<n;i++){
if(i>0&&stu[i].score!=stu[i-1].score){
r=i+1;
}
}
练习题
//4_1_15
#include<stdio.h>
#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,k,num=0;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&k);
for(int j=0;j<k;j++){
scanf("%s %d",stu[num].id,&stu[num].score);
stu[num].location_number=1;
stu[num].location_number=i;
num++;
}
sort(stu+num-k,stu+num,cmp);
stu[num-k].local_rank=1;
for(int j=num-k+1;j<num;j++){
if(stu[j].score==stu[j-1].score){
stu[j].local_rank=stu[j-1].local_rank;
}else{
stu[j].local_rank=j+1-(num-k);
}
}
}
printf("%d\n",num);
sort(stu,stu+num,cmp);
int r=1;
for(int i=0;i<num;i++){
if(i>0&&stu[i].score!=stu[i-1].score){
r=i+1;
}
printf("%s",stu[i].id);
printf("%d%d%d\n",r,stu[i].location_number,stu[i].local_rank);
}
return 0;
}