FilesExpand file tree

 main

/

InsertionSortExample.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

25 lines (22 loc) · 596 Bytes

 main

/

InsertionSortExample.java

Copy path

Top

File metadata and controls

• Code
• Blame

25 lines (22 loc) · 596 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package ch17;

import java.util.Arrays;

public class InsertionSortExample {

static int[] Insertionsort(int[] A) {

int i = 1;

while (i < A.length) {

int j = i;

while (j > 0 && A[j - 1] > A[j]) {

int temp = A[j];

A[j] = A[j - 1];

A[j - 1] = temp;

j--;

}

i++;

}

return A;

}

public static void main(String[] args) {

int[] A = new int[]{38, 27, 43, 3, 9, 82, 10};

System.out.println(Arrays.toString(Insertionsort(A)));

}

}