//求和
public class TestArray4 {
public static void main(String[] args) {
?int[] arr = new int[] {12, 43, 9, 0, -65, -99,100, 9};
//求和
int sum = 0;
for(int i = 0; i?<arr.length;i++){
sum = sum + arr[i];}
System.out.println(sum);
//求平均數(shù)
double avg = (double)sum / arr.length;
System.out.println(avg);
} }
public class TestArray5 {
?public static void main(String[] args) {
int x = 5; int y = 8;
// 交換x和y的值
int t;
t = x;
x = y;
?y = t;
System.out.println(x + "," + y);
// 選擇排序
int[] arr = new int[] { 46, 53, 21, 18, 39 };
for (int i = 0; i < arr.length - 1; i++) {
?int t = i;// 默認(rèn)i處是最小的
?for (int j = i + 1; j < arr.length; j++) { // 一旦在i后發(fā)現(xiàn)存在比其小的元素，就記錄那個(gè)元素的下角標(biāo) if (arr[t] > arr[j]) {
t = j; } }
?if (t != i) {
?int temp = arr[t];
arr[t] = arr[i];
arr[i] = temp;
?} } System.out.println("排序以后，遍歷數(shù)組：");
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + "\t"); }*/
?//冒泡排序
?int[] arr = new int[] { 6, 5, 4, 3, 2 }; // 使數(shù)組元素從小到大排列
for (int i = 0; i < arr.length - 1; i++) {
?for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
?int temp = arr[j];
?arr[j] = arr[j + 1];
arr[j + 1] = temp;
} } } System.out.println("排序以后，遍歷數(shù)組：");
?for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + "\t"); } } }
