classdataarray.java

数据结构和算法一些demo 包括冒泡排序,选择排序

package com.demo;


public class ClassDataArray {
	private Person[] a;
	private int nElems;
	
	public ClassDataArray(int maxSize){
		a = new Person[maxSize];
		nElems = 0;;
	}
	
	
	public Person find(String searchName){
		int j;
		for(j=0;j<nElems;j++){
			if(a[j].getLastName().equals(searchName)){
				break;
			}
		}
		if(j== nElems){
			return null;
		}
		else{
			return a[j];
		}
	}	//end find()
	
	public void insert(String firstName,String lastName,int age){
		a[nElems] = new Person(firstName,lastName,age);
		nElems++;
	}
	
	public boolean delete(String searchName){
		int j;
		for(j=0;j<nElems;j++){
			if(a[j].getLastName().equals(searchName)){
				break;
			}
		}
		if(j==nElems){
			return false;
		}
		else{
			for(int k=j;k<nElems;k++){
				if(k+1 < nElems)
					a[k] = a[k+1];
			}
			nElems--;
			return true;
		}
	}
	
	public void displayArray(){
		for(int i=0;i<nElems;i++){
			a[i].disPerson();
		}
	}
	
	
}