Java implementation of various sorting algorithms (insert sorting, selection sorting algorithm, bubble sort algorithm) _java

First, insert sort algorithm to implement Java version

public static int[] Insert_sort (int[] a)
{to
(int i = 0; i < a.length; i++)
{for
(int j=i+1;j>0&am p;&j<a.length;j--)
{
if (a[j]<a[j-1])
{
int tmp = A[J];//This defines initialization logic that is possible, j variable, each time the value of TMP changes
A[j] = a[j-1];
A[J-1] = tmp;
}}} return A; This design is not returned to the line, the original array has also been modified, the sequence is sorted
}

Second, the choice of sorting algorithm to implement the Java version

public static int[] Select_sort (int[] a)
{for
(int i = 0; i < a.length; i++)
{
int min_pos = I;
   for (int j=i+1;j<a.length;j++)
{
if (A[j] < A[min_pos])
{
min_pos = j;
}
}
int tmp = A[i]; Swap operation
A[i] = A[min_pos];
A[min_pos] = tmp;
}
return A;
}

Three, bubble sort algorithm Java implementation

Ordinary bubbling

public static int[] Bubble_sort (int[] a)
{for
(int i = 0; i < a.length; i++)
{
//After every trip A[i] is the first small
for (int j = a.length-1;j>i;j--)//Follow j-1 action Note j>i
{
if (A[j] < a[j-1])
{
int tmp = A[J];//swap Operation 
   A[J] = a[j-1];
A[J-1] = tmp;
}}} return A;
}

Improved bubble sort, end early

public static int[] Bubble_sort_flag (int[] a)
{
Boolean ischange = true;
for (int i = 0; i < a.length && ischange; i++)
{
ischange = false;
for (int j = a.length-1;j>i;j--)//Follow j-1 action Note j>i
{
if (A[j] < a[j-1])
{
int tmp = A[J];//SWA P Operation
A[j] = a[j-1];
A[J-1] = tmp;
Ischange = true;
}
}
return A;
}

Described above is a small set of Java implementation of the various sorting algorithm (insert sorting, select sorting algorithm, bubble sort algorithm), I hope to help you, if you have any questions please give me a message, small series will promptly reply to everyone. Here also thank you very much for the cloud Habitat Community website support!