插入法对象排序

/**
 * 插入法对象排序
 *
 */
public class ArrayInOb {
	
	private Person[] a;
	private int nElems;
	
	public ArrayInOb(int max){
		a = new Person[max];
		nElems = 0;
	}
	
	public void insert(String last,String first,int age){
		a[nElems] = new Person(last, first, age);
		nElems++;
	} 
	
	public void display(){
		for (int i = 0; i < nElems; i++) {
			a[i].displayPerson();
			System.out.println("");
		}
	}
	
	public void insertionSort(){
		int in,out;
		for (out = 1; out < nElems; out++) {
			Person temp = a[out];
			in = out;
			while (in>0&&a[in-1].getLast().compareTo(temp.getLast())>0) {
				a[in] = a[in-1];
				--in;
			}
			a[in]=temp;
		}
 	}
}

/**
 * 实体对象
 *
 */
public class Person {
	
	private String lastName;
	private String firstName;
	private int age;
	
	
	public Person(String last,String first,int a){
		this.lastName = last;
		this.firstName = first;
		this.age = a;
	}
	
	
	public void displayPerson(){
		System.out.print("LastName:"+lastName);
		System.out.print(",FirstName:"+firstName);
		System.out.println(",Age:"+age);
	}
	
	public String getLast(){
		return lastName;
	}
}


/**
 * 插入法对象排序实例
 *
 */
public class ObjectSortApp {
	
	public static void main(String[] args) {
		int maxSize = 100;
		ArrayInOb arr;
		arr = new ArrayInOb(maxSize);
		
		arr.insert("Evans", "Patty", 24);
		arr.insert("Smith", "Doc", 59);
		arr.insert("Smith", "Lorraine", 27);
		arr.insert("Smith", "Paul", 37);
		arr.insert("Yee", "Tow", 43);
		arr.insert("Hashimoto", "Sato", 21);
		arr.insert("Velasquez", "Jose", 72);
		arr.insert("Vang", "Mine", 22);
		
		System.out.println("排序前:");
		arr.display();
		
		arr.insertionSort();
		System.out.println("排序后:");
		arr.display();
	}

}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值