FilesExpand file tree

 main

/

InsertionSort.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

64 lines (48 loc) · 1.34 KB

 main

/

InsertionSort.java

Copy path

Top

File metadata and controls

• Code
• Blame

64 lines (48 loc) · 1.34 KB

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

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

package com.qian;

import com.sun.tools.javac.tree.Pretty;

/**

* 插入算法

*/

public class InsertionSort {

public static int[] insertSort(int[] array){

if(array.length==0){

return array;

}

int current ;

for(int i=0;i<array.length-1;i++){

current = array[i+1];

int preIndex = i;

while(preIndex>=0 && current<array[preIndex]){

array[preIndex+1] = array[preIndex];

preIndex--;

}

array[preIndex+1] = current;

System.out.println("preIndex+1: "+current);

}

return array;

}

public static int[] insertSort2(int[] array){

if(array.length==0){

return array;

}

for(int i=1;i<array.length;i++){

for(int j=i;j>0;j--){

if(array[j]<array[j-1]){

int temp = array[j-1];

array[j-1] = array[j];

array[j] = temp;

}

}

}

return array;

}

public static void main(String[] args) {

int[] a= new int[]{3,2,1,6,5,4};

int[]b = new int[]{3,2,1,6,5,4};

int[] result = insertSort(a);

int[] result2 = insertSort2(b);

for(int i:result2){

System.out.println(i);

}

}

}