contoh algoritma binary searching

Proses yang terjadi  menurut algoritma binary searching  ketika akan mencari  angka 23 dan 30 Abriliant Y Mandak
Sistem Informasi (IV)
N    =    16		N - 1 = 15
0	2	4	6	8	9	12	18	20	23	29	32	47	79	85	90
0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
Loop 1
( 0 + 15 ) / 2  =  7
0	2	4	6	8	9	12	18	20	23	29	32	47	79	85	90
0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
Loop 2
18 = =  23  = ?,,, F
18  <   23
0	2	4	6	8	9	12	18	20	23	29	32	47	79	85	90
0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
Loop 3
( 8 + 15)  /  2  = 11
0	2	4	6	8	9	12	18	20	23	29	32	47	79	85	90
0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
Mencari 23
Loop  1
32 = =  23  = ?,,, F
23 <  32
0	2	4	6	8	9	12	18	20	23	29	32	47	79	85	90
0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
loop 2
[ A ] 11 = 32  >  23,
n - 1 = 11 - 1  =  10			( 10 + 11 ) / 2 = 10				29 = =  23  = ?,,, F				29 > 23
0	2	4	6	8	9	12	18	20	23	29	32	47	79	85	90
0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
Loop 3
[ A ] 10 = 29  >  23,			( 9 + 10 ) / 2 = 8				[ A ] 9 = 23  =  23,
n - 1 = 10 -1  =  9
0	2	4	6	8	9	12	18	20	23	29	32	47	79	85	90
0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
						23 = =  23  = ?,,, T
Mencari 30
Loop 1
0	2	4	6	8	9	12	18	20	23	29	32	47	79	85	90
0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
32 = =  20  = ?,,, F
32 >  30
loop 2
[ A ] 11 = 32  >  30
n - 1 = 11 - 1  =  10			( 10 + 11 ) / 2 = 10				29 = =  30  = ?,,, F				29 < 30
0	2	4	6	8	9	12	18	20	23	29	32	47	79	85	90
0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
loop 3
[ A ] 10 = 29  <  30
[ A ] 10 = 29  <  31			( 9 + 10 ) / 2 = 9				23 = =  30  = ?,,, F				23 < 30
0	2	4	6	8	9	12	18	20	23	29	32	47	79	85	90
0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
loop 4
[ A ] 9 = 23  <  30
n - 1 = 9 - 1  =  8			( 8 + 10 ) / 2 = 9				23 = =  30  = ?,,, F				23 < 30
0	2	4	6	8	9	12	18	20	23	29	32	47	79	85	90
0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
Looping terus berulang...