package com.xxzzycq.sort;
public class InsertionSort
{
public static void insertSort(Comparable[] data)
{
for(int i = 1; i < data.length; i++)
{
if(data[i-1].compareTo(data[i]) > 0)
{
Comparable temp = data[i];
int j = i;
while(j > 0&&data[j-1].compareTo(temp) > 0)
{
data[j] = data[j-1];
j--;
}
data[j] = temp;
}
}
}
public static void display(Comparable[] data)
{
for (int i = 0; i < data.length; i++)
{
System.out.print(data[i]);
System.out.print(" ");
}
}
public static void main(String[] args)
{
Integer[] data = new Integer[]{45, 65, 30 , 85, 69, 78,5, 69, 987, 42, 15};
insertSort(data);
display(data);
}
}
java排序之伍------插入排序代码
最新推荐文章于 2023-11-17 18:23:08 发布