对日期排序及用二分法查找

public class TestSort {
public static void main(String[] args) {
Date[] date = new Date[5];
date[0] = new Date(2006,6,7);
date[1] = new Date(2004,5,7);
date[2] = new Date(2006,6,3);
date[3] = new Date(2005,8,7);
date[4] = new Date(2009,6,7);

Date d = new Date(2004,5,7);

compareSort(date);
for(int i=0; i<date.length; i++) {
System.out.println(date[i]);
}

System.out.println(checkP(d,date));

}

static Date[] compareSort(Date a[]) {
boolean flag = true;
Date temp;
while(flag) {
flag = false;
for(int i =0; i< a.length-1; i++) {
if(a[i].compare(a[i+1]) > 0) {
temp = a[i];
a[i] = a[i+1];
a[i+1] = temp;
flag = true;
}
}
}
return a;
}

static String checkP(Date d,Date[] date) {
int aStart = 0;
int aEnd = date.length-1;
int halfNum =0;
int leftNum=0;
int wide = 0;
boolean flag = true;
if(date[aStart].compare(d)>0||date[aEnd].compare(d)<0) {
return "input is out of scope";
}
while(flag==true) {
halfNum = (aEnd + aStart)/2;
leftNum = aEnd - aStart;

if(leftNum==1&&date[halfNum].compare(d)!=0) {
halfNum = -1;
wide = 1;
flag = false;
}

else if(date[halfNum].compare(d)==0) {
flag = false;
}
else if(date[halfNum].compare(d)>0) aEnd = halfNum;
else if(date[halfNum].compare(d)<0) aStart = halfNum;
}
if(wide == 1) return "date is not exsit in scope";
return "位置在：d["+halfNum+ "]";
}

}

class Date {
int year,month,day;
Date(int y, int m, int d) {
year = y;
month = m;
day = d;
}

int compare(Date a) {
return year > a.year? 1  :
year < a.year? -1 :
month > a.month? 1 :
month < a.month? -1 :
day > a.day? 1 :
day < a.day? -1 :0;
}

public String toString() {
return "year-month-day :" + year + "-" + month + "-" + day;
}
}

public class TestDateSort {
public static void main(String[] args) {
Date[] days = new Date[5];
days[0] = new Date(2006, 5, 4);
days[1] = new Date(2006, 7, 4);
days[2] = new Date(2008, 5, 4);
days[3] = new Date(2004, 5, 9);
days[4] = new Date(2004, 5, 4);

Date d = new Date(2006, 8, 4);
String str = String.valueOf(d);
//str = d.toString();
bubbleSort(days);

for(int i=0; i<days.length; i++) {
System.out.println(days[i]);
}

System.out.println(binarySearch(days, d));
}

public static Date[] bubbleSort(Date[] a){
int len = a.length;
for(int i = len-1;i>=1;i--){
for(int j = 0;j<=i-1;j++){
if(a[j].compare(a[j+1]) > 0){
Date temp = a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
return a;
}

public static int binarySearch(Date[] days, Date d) {
if (days.length==0) return -1;

int startPos = 0;
int endPos = days.length-1;
int m = (startPos + endPos) / 2;
while(startPos <= endPos){
if(d.compare(days[m]) == 0) return m;
if(d.compare(days[m]) > 0) {
startPos = m + 1;
}
if(d.compare(days[m]) < 0) {
endPos = m -1;
}
m = (startPos + endPos) / 2;
}
return -1;
}
}

class Date {
int year, month, day;

Date(int y, int m, int d) {
year = y; month = m; day = d;
}

public int compare(Date date) {
return year > date.year ? 1
: year < date.year ? -1
: month > date.month ? 1
: month < date.month ? -1
: day > date.day ? 1
: day < date.day ? -1 : 0;
}

public String toString() {
return "Year:Month:Day -- " + year + "-" + month + "-" + day;
}
}