如何利用實作Interface Comparator來sort, binaySearch
import java.util.*;
import java.util.Arrays;
class student
{
String name;
int number;
student(String name, int number)
{
this.name=name;
this.number=number;
}
void printData()
{
System.out.print(name+'\t');
System.out.println(number);
}
}
class studentComparator implements Comparator<student> {
public int compare(student X1, student X2)
{
return X1.number-X2.number;
}
}
class SortStudent{
public static void main(String argv[]){
student X[]=new student[10];
for (int i=0; i<=9; i++)
{
X[i]=new student("學生"+i, (int)(100*Math.random()));
X[i].printData();
}
studentComparator C=new studentComparator();
Arrays.sort(X, C);
System.out.println("排序後");
for (int i=0; i<=9; i++)
{
X[i].printData();
}
student key=new student("學生"+0,50);
System.out.println(Arrays.binarySearch(X,key,C));
}
}
//http://download.oracle.com/javase/6/docs/api/java/util/Arrays.html
//http://download.oracle.com/javase/6/docs/api/java/util/Comparator.html
herrDeng網內搜尋

自訂搜尋
Ads
熱門文章
-
教育部為提昇全民資安素養與電腦防護能力,本部於101年9月5日至11月5日舉辦「全民資安素養自我評量」活動,請在活動期間內踴躍上網檢測資訊安全素養認知程度,並有機會參與抽獎,詳情請參閱活動網站(網址: https://isafe.moe.edu.tw/event
-
Py3排序 C++nth_element速解Leetcode 2099 Find Subsequence of Length K With the Largest Sum C++的nth_element很好用,基本上是做partition,在這個問題可取代sort ---- C...
-
Py3 C++計數排序counting sort解Leetcode 2294 Partition Array Such That Maximum Difference Is K 基本上使用Greedy sort,而排序就用counting sort [Python C++計數排...
-
Py3 C++位元計算bitset速解Leetcode難題3307 Find the K th Character in String Game II [Py3 一行解請進]