Академический Документы
Профессиональный Документы
Культура Документы
Bina Nusantara
Searching
Single match
Multiple match
Bina Nusantara
Metode Searching
Sequential Search
Binary Search
Interpolation Search
Bina Nusantara
Sequential Search
Bina Nusantara
Contoh Sequential Search
Bina Nusantara
Contoh Sequential Search
Bina Nusantara
Contoh Sequential Search
Bina Nusantara
Binary Search
Bina Nusantara
Binary Search
Bina Nusantara
Contoh Simulasi Binary search
Key = 2207023060
Bina Nusantara
Contoh Simulasi Binary search
Key = 2207023022
No low high mid Keterangan
Bina Nusantara
Algoritma Binary search
Bina Nusantara
Interpolation Search
Bina Nusantara
Interpolation Search
Rumus:
kunci data[low]
posisi = -------------------------- x (high low) + low
data[high] data[low]
Bina Nusantara
Contoh Interpolation Search
Kd Judul Penulis
[0] 025 The C++ programing Bjarne Strous
[1] 034 Mastering Delphi 6 Marco Cantu
[2] 041 Professionl C# Simon Robin
[3] 056 Pure Corba Fintan Balron
[4] 063 Advanced JSP David Geary
[5] 072 Duration Calculus Zhou Cao Zen
[6] 088 Algebra Mastering Zohar Manna
[7] 096 Visual Basic Prof 6 F. P. Brooz
Bina Nusantara
Contoh Interpolation Search
Bina Nusantara
Contoh Interpolation Search
Low = 4, high = 7
Kode tidak ada dalam data
Bina Nusantara
Latihan Interpolation Search
Bina Nusantara
Algoritma Interpolation Search
int InterPolSearch(int *data, int N, int Key)
{
int low, high, pos;
float tmp;
low = 0;
high = N-1;
while(data[low] <= data[high] )
{
tmp = (Key-data[low])/(data[high]-data[low])
pos = tmp*(high-low) + low;
if( data[pos] == Key )
return(pos);
else if( data[pos] < Key )
low = pos + 1;
else
high = pos - 1;
}
return(-1);
}
Bina Nusantara