方法一:
import java.util.Scanner;
public class Test11 {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String oldBook[] = new String[]{"Computer","Hibernate","Java","Struts"};
String newBook[] = new String[oldBook.length+1];
String book="";
int index=oldBook.length;
System.out.print("插入前的数组为:");
for(int i=0;i<oldBook.length;i++)
{
System.out.print(oldBook[i]+"\t");
}
for(int i=0;i<oldBook.length;i++)
{
newBook[i]=oldBook[i];
}
System.out.print("\n请输入新书名称:");
book=input.next();
for(int i=0;i<oldBook.length;i++)
{
if(oldBook[i].compareToIgnoreCase(book)>0)
{
index=i;
break;
}
}
for(int i=newBook.length-1;i>index;i--)
{
newBook[i]=newBook[i-1];
}
newBook[index]=book;
System.out.print("插入后的数组为:");
for(int i=0;i<newBook.length;i++)
{
System.out.print(newBook[i]+"\t");
}
}
}
方法二:
import java.util.Arrays;
import java.util.Scanner;
public class Test1 {
public static void main(String[] args){
Scanner input = new Scanner(System.in);
String oldBook[] = new String[]{"Computer","Hibernate","Java","Struts"};
String newBook[] = new String[oldBook.length+1];
String book="";
System.out.print("插入前的数组为:");
for(int i=0;i<oldBook.length;i++)
{
System.out.print(oldBook[i]+"\t");
}
System.out.print("\n请输入新书名称:");
book=input.next();
for(int i=0;i<newBook.length;i++)
{
if(i==oldBook.length)
{
newBook[i]=book;
break;
}
newBook[i]=oldBook[i];
}
Arrays.sort(newBook);
System.out.print("插入后的数组为:");
for(int i=0;i<newBook.length;i++)
{
System.out.print(newBook[i]+"\t");
}
}
}
插入排序优化与实现
本文详细介绍了使用Java语言实现插入排序算法的过程,并通过代码实例展示了如何优化算法以提高效率。文章首先介绍了插入排序的基本概念,然后通过两种不同方法实现算法,最后通过比较展示了优化前后的时间复杂度变化。
944

被折叠的 条评论
为什么被折叠?



