Searching ( Pencarian )
1.
Sequentian
2.
Metode bagi 2 ( Binary search )
Sequentian
|
|
15
|
3
|
9
|
45
|
A [1] =X False
A [2] =X False
A [3] =X True → Stop Searching
X Ada pada Indeks ke 3
Metode bagi 2 ( Binary search )
13
|
15
|
21
|
34
|
37
|
45
|
48
|
52
|
59
|
63
|
K = (1+n) div 2
K1 = (1+10) div 2 = 5,5 dibulatkan 5
|
|
|
|
13
|
15
|
21
|
34
|
37
|
45
|
48
|
52
|
59
|
63
|
|
|
A[K1] = x , A[K1] ≠ x , Cek apakah lebih besar ato lebih kecil
Jika A[K1]
< X → A[K1+1] . . . A[N]
Jika A[K1]
> X → A[K1-1] . . . A[K1]
A[K1] < X → A[K1+1] . . . A[N] → A[6} . . . A[10]
13
|
15
|
21
|
34
|
37
|
45
|
48
|
52
|
59
|
63
|
|
K2 = ( 6 + 10 ) Div 2 = 8
A[K2] = X
→
Stop searching
X ada pada Indeks Ke – 8
SORTING / PENGURUTAN DATA
Proses menyusun kumpulan data yang seragam
dengan aturan urut menaik ( ascending ), atau urut menurun ( descending )
Aturan :
Ascending : a…z, 1…10
3,8,18,24,69,70
Descending :
z…a, 100…1.
70,69,24,18,8,3
METODE
PENGATURAN
·
Metode Selection
·
Metode Buble
·
Metode Insertion
Metode Selection Search
Contoh Nilai-nilai data yang belum terurut
:
27
|
80
|
02
|
46
|
16
|
12
|
50
|
1
|
2
|
3
|
4
|
5
|
6
|
7
|






Pass VI : 02 12 16 27 46 50 80
Metode Buble Search

Contoh Nilai-nilai data yang belum terurut
:
12
|
9
|
3
|
7
|
N


Langkah 2 : 12 3 9 7



Langkah 2 : 3 7 12 9

Metode Inseption
Search
Misalkan larik L
dengan N=6 sebagai berikut
29
|
27
|
10
|
8
|
76
|
21
|
1
|
2
|
3
|
4
|
5
|
6
|
Maka langkah –
langkah pengurutannya adalah :
Nilai semula
|
29
|
27
|
10
|
8
|
76
|
21
|
Langkah 1
|
27
|
29
|
10
|
8
|
76
|
21
|
Langkah 2
|
10
|
27
|
29
|
8
|
76
|
21
|
Langkah 3
|
8
|
10
|
27
|
29
|
76
|
21
|
Langkah 4
|
8
|
10
|
27
|
29
|
76
|
21
|
Langkah 5
|
8
|
10
|
21
|
27
|
29
|
76
|
Langkah 6
|
|
|
|
|
|
|
Latihan
infik
|
prefik
|
Posfik
|
(A+B) /C*D
|
*/+ABCD
|
AB+C/DX
|
P*(Q-R)/T
|
/*P-QRT
|
PQR-T/
|
(A+B)-(C*D)
|
-+AB*CD
|
AB+CD*-
|
A*B”C-D
|
-*A”BCD
|
ABC”D-
|
A+(B-C)*D
|
+A*-BCD
|
ABC-D*+
|
A*(B+C)/(D-E)
|
/*A+BC-DE
|
ABD+*DE-/
|
ConversionConversion EmoticonEmoticon