C++笔记

冒泡排序

#include<iostream>
using namespace std;
int main() {
	int a[10] = { 4,5,6,7,8,9,1,2,3,10};
	cout << "排序之前" << endl;
	for (int i = 0; i < 10; i++) {
		cout << a[i] << endl;
	}
	cout << "排序之后" << endl;
	for (int i = 0; i < 10 - 1; i++) {

		for (int j = 0; j < 10 - i - 1; j++) {
			if (a[j] > a[j + 1]) {
				int temp = a[j+1];
				a[j + 1] = a[j];
				a[j] = temp;
			}
		}
	}

	for (int i = 0; i < 10; i++) {
		cout << a[i] << endl;
	}
}

用函数，指针，数组冒泡排序

#include<iostream>
using namespace std;
void bubble(int* a, int len) {//int len为数组长度，决定冒泡排序的次数

	for (int i = 0; i < len - 1; i++) {

		for (int j = 0; j < len - i - 1; j++) {
			if (a[j] > a[j + 1]) {
				int temp = a[j + 1];
				a[j + 1] = a[j];
				a[j] = temp;
			}
		}
	}
}
int main() {
	int a[10] = { 4,5,6,7,8,9,1,2,3,10 };
	int len = sizeof(a) / sizeof(a[0]);

	cout << "排序之前" << endl;
	for (int i = 0; i < 10; i++) {
		cout << a[i] << endl;
	}

	bubble(a, len);
	cout << "排序之后" << endl;

	for (int i = 0; i < 10; i++) {
		cout << a[i] << endl;
	}
}

求a的b次方

#include<iostream>
using namespace std;
int main() {
	cout << "求a的b次方" << endl;
	double a, b = 0;		double c = 1;
	cin >> a;	cin >> b;
	for (int i = 0; i < b; i++) {
		c *= a;
	}
	cout << a << "的" << b << "次方=" << c << endl;
}