- public class Insert {
- public void sort(int[] r) {
- for (int i = 1; i < r.length; i++) {
- int c = r[i];
- int j = i - 1;
- while (j >= 0 && r[j] > c) {
- r[j + 1] = r[j];
- j--;
- }
- r[j + 1] = c;
- }
- for (int n = 0; n < r.length; n++) {
- System.out.print(r[n] + ",");
- }
- }
- public static void main(String[] args) {
- int[] values = { 3, 1, 6, 2, 9, 0, 7, 4, 5 };
- Insert cbean = new Insert();
- cbean.sort(values);
- }
- }
插入法(Java语言)
最新推荐文章于 2022-09-27 00:26:56 发布