數(shù)據(jù)結(jié)構(gòu) 實(shí)習(xí)6：查找

1、實(shí)習(xí)6：查找1、實(shí)驗(yàn)?zāi)康耐ㄟ^(guò)編寫(xiě)和調(diào)用學(xué)過(guò)的三個(gè)查找算法實(shí)現(xiàn)數(shù)據(jù)查找，充分理解各種查找算法的算法思想 及各自的時(shí)間復(fù)雜度、適用性。2、實(shí)驗(yàn)內(nèi)容在排序?qū)嶒?yàn)的基礎(chǔ)上，在順序表類(lèi)SeqList中添加成員函數(shù)：不帶監(jiān)視哨的順序查找算法；帶監(jiān)視哨的順序查找算法；二分查找算法；編寫(xiě)主程序，循環(huán)選擇調(diào)用以上3個(gè)查找算法，分別對(duì)鍵入的關(guān)鍵字記錄進(jìn)行 成功和不成功查找。注意：在調(diào)用二分查找算法前必須先對(duì)查找表排序。編譯、運(yùn)行、調(diào)試，觀察排序效果。public class KeyType implements Comparable public int key;public KeyType()public Key

2、Type(int key)this.key = key;public String toString()return key + ”;public int compareTo(KeyType another)int thisVal = this.key;int anotherVal = another.key;return(thisVal anotherVal ? -1 : (thisVal = anotherVal ? 0 : 1);/public class RecordNode public Comparable key;public Object element;public Reco

3、rdNode(Comparable key) this.key = key;public RecordNode(Comparable key,Object element) this.key = key;this.element = element;public Object getKey() return key;/public class SeqList public RecordNode r;public int curlen;public SeqList(int maxSize)this.r = new RecordNodemaxSize;this.curlen = 0;public

4、void clear()curlen = 0;public void insert(int i,RecordNode x)throws Exception if(curlen = r.length)throw new Exception(順序表已滿);if(i curlen)throw new Exception(插入位置不合理);for(int j = curlen; j i;j) rj = rj - 1;ri = x;this.curlen+;public void insertSort()RecordNode temp;int i,j;for(i = 1;i = 0 & pareTo(r

5、j.key) 0;j) r j + 1 = rj;rj + 1 = temp;public void insertSortWithGuard()int i,j;for(i = 1; i this.curlen;i+)r0 = ri;for(j = i- 1;r0.pareTo(rj.key) 0;j) rj + 1 = rj;rj + 1 =r0;public void shellSort(int d)RecordNode temp;int i,j;for(int k = 0;k d.length;k+)int dk = dk;for(i = dk;i = 0 & pareTo(rj.key)

6、 0;j -= dk) rj + dk = rj;rj + dk = temp;public void bubbleSort()RecordNode temp; boolean flag = true;for(int i = 1;i this.curlen & flag;i+) flag = false;for(int j = 0;j 0) temp = rj;rj = rj + 1; rj + 1 =temp; flag = true;public int Partition(int i,int j) RecordNode pivot = ri;while(i j)while(i j & p

7、areTo(rj.key) = 0) j-;if(i j)ri = rj;i+;while(i 0) i+;if(i j) rj = ri; j-;ri = pivot;return i;public void qSort(int low,int high)if(low high)int pivotloc = Partition(low,high); qSort(low,pivotloc - 1);qSort(pivotloc + 1,high);public void quickSort()qSort(0,this.curlen - 1);public int length() return

8、 curlen;public void display() for(int i =0;i this.curlen;i+)System.out.print( + ri.getKey().toString();System.out.println();public int seqSearch(Comparable key)int i = 0,n = length();while(i n & ri.pareTo(key) != 0)i+;if(i 0)return i;elsereturn -1;public int binarySearch(Comparable key)if(length() 0

9、)int low = 0,high = length() - 1;while(low 0) high = mid - 1;elselow = mid + 1;return -1;public void remove(int i) / todo自動(dòng)生成的方法存根/import java.util.Scanner;public class SeqSearch public static void main(String args)throws Exception int口 data = 89,7,46,28,4,53,7,15;int maxSize = 20;SeqList L = new SeqList(maxSize);SeqList LL = new SeqList(maxSize);while(true)for(int i = 0;i data.length;i+)KeyType key = new KeyType(datai);Object element = datai;RecordNode r = new RecordNode(key,eleme