- 技术
- Java数组排序之插入排序01
public static void simpleInsertSort(int[]data
){
for (int i
= 1; i
< data
.length
; i
++) {
for(int j
=i
;j
>0;j
--){
if(data
[j
]<data
[j
-1]){
int temp
=data
[j
-1];
data
[j
-1]=data
[j
];
data
[j
]=temp
;
}
}
System
.out
.println(Arrays
.toString(data
));
}
}
public static void insertSort(int[]data
){
int arrrayLength
=data
.length
;
for(int i
=1;i
<arrrayLength
;i
++){
int temp
=data
[i
];
if(data
[i
]-data
[i
-1]<0){
int j
=i
-1;
for(;j
>=0&&data
[j
]-temp
>0;j
--){
data
[j
+1]=data
[j
];
}
data
[j
+1]=temp
;
}
System
.out
.println(Arrays
.toString(data
));
}
}
Processed:
0.010, SQL:
9
