-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSelectOrder.java
More file actions
89 lines (74 loc) · 1.66 KB
/
SelectOrder.java
File metadata and controls
89 lines (74 loc) · 1.66 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
import java.util.Arrays;
import java.util.Comparator;
public class SelectOrder{
public void bolubo(int[] arr){
for (int i=0;i<arr.length; i++ ) {
for (int j=0; j<= arr.length-1 ; j++ ) {
if(arr[i] < arr[j]){
swap(arr,i,j);
}
}
}
}
public void select(int[] arr){
for (int i=0; i<arr.length ; i++) {
int minIndex = i;
for (int j = i;j<arr.length ;j++ ) {
minIndex = arr[minIndex]<arr[j] ? minIndex : j;
}
swap(arr,i,minIndex);
}
}
public void swap(int[] arr, int i,int j){
int temp = arr[i];
arr[i] = arr[j];
arr[j]=temp;
}
public void printArr(int[] arr){
for (int i=0;i<arr.length ;i++ ) {
System.out.print(arr[i]+",");
}
System.out.println();
}
public int[] createArray(int length,int max){
int[] arr = new int[length];
for (int i=0; i<length; i++ ) {
arr[i] = (int)(Math.random()*max);
}
return arr;
}
public int[] copyArr(int[] arr){
int[] copy = new int[arr.length];
for (int i=0; i<arr.length; i++ ) {
copy[i] = arr[i];
}
return copy;
}
public Boolean Compara(int[] one, int[] two){
for (int i=0;i<one.length ;i++ ) {
if(one[i] != two[i])
return false;
}
return true;
}
public static void main(String[] args){
boolean isPass = true;
SelectOrder select = new SelectOrder();
for (int i=0; i<999999;i++ ) {
int[] arr= select.createArray(30,10000);
int[] copy = select.copyArr(arr);
int[] copy_orign = select.copyArr(arr);
Arrays.sort(arr);
//select.bolubo(arr);
select.select(copy);
if(!select.Compara(arr,copy)){
select.printArr(copy_orign);
isPass=false;
break;
}
}
if(isPass){
System.out.println("successfuly");
}
}
}