Java- 15-数组，冒泡排序

最新推荐文章于 2024-11-27 20:33:11 发布

转载最新推荐文章于 2024-11-27 20:33:11 发布 · 229 阅读

Java 专栏收录该内容

16 篇文章

订阅专栏

本文详细介绍Java中数组的遍历方法，包括for循环、for...each及Arrays.toString()的使用，多维数组的快速打印，以及两种排序方法：冒泡排序的实现和Arrays.sort()的高效应用。

遍历数组：

for循环遍历
for...each遍历
Arrays.toString()快速打印数组元素

import java.util.Arrays;

public class ForCir{
	
	static int[] nList = {34, 56, 89, 34, 35, 66, 80, 21, 58};
	
	public static void main(String[] args) {
		System.out.println(nList); //print the address of nList: [I@7852e922
		System.out.println(Arrays.toString(nList)); //快速打印数组内容
	}


--------------------------
[I@7852e922
[34, 56, 89, 34, 35, 66, 80, 21, 58]

多维数组快速打印用deepToString()

import java.util.Arrays;


public class ForCir{
	
	static int[][] nList = {
			{37, 56, 89, 34, 35, 66, 80, 21, 58},
			{39, 56, 89, 34, 35, 66, 80, 21, 58},
			{89, 56, 89, 34, 35, 66, 80, 21, 58},
			};
	
	public static void main(String[] args) {		
	 
		System.out.println(Arrays.deepToString(nList));
	}
	
}

冒泡排序：

用for循环来实现

import java.util.Arrays;


public class ForCir{
	
	static int[] nList = {34, 56, 89, 34, 35, 66, 80, 21, 58};
	
	public static void main(String[] args) {
		
		for (int i = 0; i < nList.length; i++) {
			for (int j = i; j < nList.length; j++) {
				if (nList[i] > nList[j]) {
					int tem = nList[i];
					nList[i] = nList[j];
					nList[j] = tem;
				}				
			}			
		}		
		System.out.println(Arrays.toString(nList));
	}
	
}
---------------------------------
[21, 34, 34, 35, 56, 58, 66, 80, 89]

用Arrays中的sort方法来实现

import java.util.Arrays;


public class ForCir{
	
	static int[] nList = {37, 56, 89, 34, 35, 66, 80, 21, 58};
	
	public static void main(String[] args) {
		
		Arrays.sort(nList);
		System.out.println(Arrays.toString(nList));
	}
	
}