1.(n,m)之间素数和(0,1不是素数)
#include<iostream>
using namespace std;
bool isprime(int x) {
if (x == 1) {
return false;
}
else {
for (int i = 2; i < x; i++) {
if (x % i == 0) {
return false;
}
}
}
}
int main() {
int m = 0,n=0, sum = 0,num=0;
cin >> m >> n;
for (int num = m; num <= n; num++) {
if (isprime(num)) {
sum = sum + num;
}
}
cout << "sum=" << sum << endl;
return 0;
}
2(1).冒泡排序(从小到大)
#include<iostream>
using namespace std;
//冒泡排序(从小到大)
int main() {
int arr[10] = { 7,3,8,6,7,9,10,2,5,2};
int i = 0, j = 0;
for (i = 0; i < 10-1; i++){
for (j = 0; j < 10 - 1 - i; j++) {
if (arr[j + 1] < arr[j]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
for (int i = 0; i < 10; i++) {
cout << arr[i] << endl;
}
return 0;
}
2(2).冒泡排序(从小到大,函数)
#include<iostream>
using namespace std;
//冒泡排序(从小到大)
//函数传数组只有首地址,丢失长度
void bubblesort(int arr[], int len) {//int arr[]等于int *arr
int i = 0, j = 0;
for (i = 0; i < len - 1; i++) {
for (j = 0; j < len - 1 - i; j++) {
if (arr[j + 1] < arr[j]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
void print(int arr[], int len) {
int i = 0;
for (int i = 0; i < 10; i++) {
cout << arr[i] << endl;
}
}
int main() {
int arr[10] = { 7,3,8,6,7,9,10,2,5,2};
bubblesort(arr, 10);
print(arr, 10);
return 0;
}