huanghai/python
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

'commit'

Browse Source
This commit is contained in:
HuangHai
2025-08-30 18:35:01 +08:00
commit 1f397eca87
6258 changed files with 1487241 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

50
C++专题课程/排序/C++快速排序调用.cpp Normal file
View File

@@ -0,0 +1,50 @@
#include<bits/stdc++.h>
using namespace std;
//<2F><><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD>ȡ<EFBFBD><C8A1><EFBFBD>鳤<EFBFBD>ȵĺ<C8B5>
#define length(arr) ((sizeof(arr)) / (sizeof(arr[0])))
/*
<EFBFBD><EFBFBD><EFBFBD>ܣ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
<EFBFBD><EFBFBD><EFBFBD>ߣ<EFBFBD><EFBFBD>ƺ<EFBFBD>
ע<EFBFBD>⣺<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʱ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݵ<EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD><EFBFBD><EFBFBD>׵<EFBFBD>ַ<EFBFBD><EFBFBD>ָ<EFBFBD>롣
<EFBFBD>Ե<EFBFBD><EFBFBD>ú<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ԣ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ĵ<EFBFBD>С<EFBFBD>Dz<EFBFBD><EFBFBD><EFBFBD><EFBFBD>õġ<EFBFBD><EFBFBD><EFBFBD>ָ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>4<EFBFBD>ֽڡ<EFBFBD><EFBFBD><EFBFBD>
*/
void print(int array[],int size) {
for(int i = 0; i < size; i++)
printf("%d ", array[i] );
printf("\n");
}
//<2F><><EFBFBD><EFBFBD>
bool cmpDesc(int a,int b) {
return a>b;//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
}
//<2F><><EFBFBD><EFBFBD>
bool cmpAsc(int a,int b) {
return a<b;//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
}
int main() {
//ԭʼ<D4AD><CABC><EFBFBD><EFBFBD>
int arr[]= {1, 9, 12, 29, 0, 31, 8, 10};
//<2F><><EFBFBD>鳤<EFBFBD><E9B3A4>
int size=length(arr);
//<2F><><EFBFBD><EFBFBD>ԭʼ<D4AD><CABC><EFBFBD><EFBFBD>
print(arr,size);
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>(<28><><EFBFBD><EFBFBD>)
sort(arr, arr + size,cmpDesc); //arr<72>ĵ<EFBFBD>ַ<EFBFBD><D6B7>ʼ<EFBFBD><CABC><EFBFBD><EFBFBD>arr+size<7A>ĵ<EFBFBD>ַ<EFBFBD><D6B7><EFBFBD><EFBFBD>
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
print(arr,size);
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>(<28><><EFBFBD><EFBFBD>)
sort(arr, arr + size,cmpAsc); //arr<72>ĵ<EFBFBD>ַ<EFBFBD><D6B7>ʼ<EFBFBD><CABC><EFBFBD><EFBFBD>arr+size<7A>ĵ<EFBFBD>ַ<EFBFBD><D6B7><EFBFBD><EFBFBD>
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
print(arr,size);
return 0;
}

30
C++专题课程/排序/对结构体快速排序.cpp Normal file
View File

@@ -0,0 +1,30 @@
#include<bits/stdc++.h>
using namespace std;
//ѧ<><D1A7><EFBFBD>Ľṹ<C4BD><E1B9B9>
typedef struct student {
char name[20];
int math;
int english;
} Student;
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
bool cmp(Student a,Student b);
int main() {
//<2F>Ȱ<EFBFBD>math<74>Ӵ<EFBFBD><D3B4><EFBFBD>С<EFBFBD><D0A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD>math<74><68><EFBFBD>ȣ<EFBFBD><C8A3><EFBFBD>english<73>Ӵ<EFBFBD><D3B4><EFBFBD>С<EFBFBD><D0A1><EFBFBD><EFBFBD>
Student a[4]= {{"xiaoming",67,89},{"limei",90,56},{"zhaosi",90,99}};
sort(a,a+3,cmp);
for(int i=0; i<3; i++)
cout<<a[i].name <<" "<<a[i].math <<" "<<a[i].english <<endl;
return 0;
}
//<2F><><EFBFBD><EFBFBD>ʵ<EFBFBD><CAB5>
bool cmp(Student a,Student b) {
if(a.math <b.math )
return a.math <b.math ;//<2F><>math<74>Ӵ<EFBFBD><D3B4><EFBFBD>С<EFBFBD><D0A1><EFBFBD><EFBFBD>
else if(a.math ==b.math )
return a.english>b.english ; //math<74><68><EFBFBD>ȣ<EFBFBD><C8A3><EFBFBD>endlish<73>Ӵ<EFBFBD><D3B4><EFBFBD>С<EFBFBD><D0A1><EFBFBD><EFBFBD>23
}