JSP Insert Sort algorithm Instance code

public class Charusort {
public static void Main (string[] args) {

Int[] sort={4,6,3,9,5};

Sort (sort);

for (int i=0;i<sort.length;i++)

System.out.print (sort[i]+ "");

}

public static void sort (int[] sort) {

int i; Number of scans

Int J; As the element of comparison.

for (i=1;i<sort.length;i++) {//Scan count is sort.length-1

int temp; Temp for staging data

Temp=sort[i];

J=i-1;

while (J>=0&&temp<sort[j]) {//If the second element is less than the first element

SORT[J+1]=SORT[J]; Push all the elements back one position

j--;

}

Sort[j+1]=temp; The smallest element is placed in the first position

}

}

}