Java 使用选择排序对数组排序。
使用选择排序对数组排序。
实例源码：
源代码：
执行
执行中...
x
1
2
import java.security.SecureRandom;3
4
import java.util.Arrays;5
6
7
public class Main/*NowJava.com - 时代Java 提 供*/8
9
{10
11
// sort array using selection sort12
13
public static void selectionSort(int[] data) 14
15
{16
17
// loop over data.length - 1 elements 18
19
for (int i = 0; i < data.length - 1; i++)20
21
{22
23
int smallest = i; // first index of remaining array24
//来自 时 代 J a v a - nowjava.com25
26
// loop to find index of smallest element 27
28
for (int index = i + 1; index < data.length; index++)29
30
if (data[index] < data[smallest]) 31
32
smallest = index; 33
34
35
swap(data, i, smallest); // swap smallest element into position36
37
printPass(data, i + 1, smallest); // output pass of algorithm 38
39
} 40
41
} 42
43
44
// helper method to swap values in two elements45
46
private static void swap(int[] data, int first, int second)47
48
{49
50
int temporary = data[first]; // store first in temporary51
52
data[first] = data[second]; // replace first with second53
54
data[second] = temporary; // put temporary in second55
56
} 57
58
59
private static void printPass(int[] data, int pass, int index)60
61
{62
63
System.out.printf("after pass %2d: ", pass);64
65
66
// output elements till selected item67
68
for (int i = 0; i < index; i++)69
70
System.out.printf("%d ", data[i]);71
72
73
System.out.printf("%d* ", data[index]); // indicate swap74
75
76
// finish outputting array77
78
for (int i = index + 1; i < data.length; i++)79
80
System.out.printf("%d ", data[i]);81
82
83
System.out.printf("%n "); // for alignment84
85
86
// indicate amount of array that?s sorted87
88
for (int j = 0; j < pass; j++)89
90
System.out.print("-- ");91
92
System.out.println(); 93
94
} 95
96
97
public static void main(String[] args)98
99
{100
101
SecureRandom generator = new SecureRandom();102
103
104
int[] data = new int[10]; // create array105
106
107
/**代码未完, 请加载全部代码(NowJava.com).**/执行结果：
本文系作者在时代Java发表，未经许可，不得转载。如有侵权，请联系nowjava@qq.com删除。
编辑于
关注时代Java