c++学习（5）一维数组

1.输出数组中的最大值。

#include<iostream>
using namespace std;
int main() {
	int arr[] = { 300,350,200,400,250 };
	int max = 0;
	for (int i = 0; i < 5; i++) {
		if (max <= arr[i]) {
			max = arr[i];
			cout << i << endl;
		}
		
	}
	cout << max << endl;
	system("pause");
	return 0;
}

2.数组元素逆置。

#include<iostream>
using namespace std;
//注意先创建一个临时内存空间（temp），防止前面的被覆盖。
int main() {
	//1.创建数组
	int arr[] = { 1,3,5,4,2 };
	for (int i = 0; i < 5; i++) {
		cout << arr[i] << "\t";
	}
	cout <<endl;
	//2.实现逆置
	//下标，当下标重合结束循环
	int start = 0;
	int end = sizeof(arr) / sizeof(arr[0])-1;//注意从0开始，所以-1
	while (start < end) {
		int temp = arr[start];
		arr[start] = arr[end];
		arr[end] = temp;
		start++; end--;
	}
	for (int i = 0; i < 5; i++) {
		cout << arr[i] << "\t";
	}

	system("pause");
	return 0;
}

3.利用冒泡排序将数组元素按照从小到大排列。

#include<iostream>
using namespace std;
//冒泡排序
/*
1.排序总轮数：元素个数-1
2.每轮对比次数：元素个数-排序轮数-1
*/
int main() {
	
	int arr[] = {2,4,0,5,7,1,3,8,9};
	int n = sizeof(arr) / sizeof(arr[0]);
	cout << "排序之前数组：" << "\t";

	for (int i = 0; i < n; i++) {
		cout << arr[i] << "\t";
	}
	cout <<endl;

	for (int i = 0; i < n-1; i++) { 
		for (int j = 0; j < n - i - 1; j++) {
			int temp;
			if (arr[j] >= arr[j + 1]) {
				temp = arr[j + 1];
				arr[j + 1] = arr[j];
				arr[j] = temp;
			}
		}
	}
	cout << "排序之后数组："<<"\t";

	for (int i = 0; i < n; i++) {
		cout << arr[i] << "\t";
	}
	cout << endl;

	system("pause");
	return 0;
}