<!– @page { size: 8.5in 11in; margin: 0.79in } P { margin-bottom: 0.08in } –>
Saya menggunakan COMPILER di LINUX [g++], dan di karenakan di linux tidak tersedia CONIO.H, jadi script di bawah ini saya berikan TAG KOMENTAR /* */, dan jika ingin menguji-nya dengan COMPILER TURBO C WINDOWS, silahkan di hilangkan tag komentar-nya.
=================================================================================
#include <stdio.h>
#include<iostream.h>
/* #include<conio.h> */
int data[] = {11,15, 17, 25, 30, 43, 51, 57, 63, 65, 68, 70, 75, 84,110,116,200,208,500,1500};
int first,end, middle, j, search,i,result;
char pil;
int cari(int data[], int first, int end, int search) {
if (search == first) {
return 0; }
if (first <= end) {
int middle = (first + end) / 2;
if (search == data[middle])
return middle;
else if (search < data[middle])
return cari(data, first, middle-1, search);
else
return cari(data, middle+1, end, search);
}
return -(first + 1);
}
int forloop(int i){
if (i<0)
return 0;
else
forloop( i – 1);
printf(“%d “,data[i]);
return 0;
}
int header()
{
printf(“\n*********************************************************”);
printf(“\n<|| Binary Search Recursive Ascending Way ||>”);
printf(“\n===================================================”);
return 0;
}
int footer()
{
printf(“\n*********************************************************”);
printf(“\n<|| Algoritma Pemrograman II – Anis Cherid ||>”);
printf(“\nThanks for using. Created by: www.rizqtech.net.”);
printf(“\n=================================================\n”);
return 0;
}
int main()
{
pil=’ ‘;
do
{
/ *clrscr(); */
j = 0;
first = 0;
end = 20 – 1;
header();
printf(“\n -=( Listed Data Array )=- \n\n”);
forloop(end);
printf(“\n\n => ENTER DATA YOU CAN SEARCH = “);
scanf (“%d”, &search);
putchar(‘\n’);
result = cari(data,first,end,search);
if (result < 0)
cout<<”Sorry !!!Data not found\n”;
else
cout<<” Data found in index => “<<cari(data,first,end,search);
printf(“\n\n Searching Again ?(Yes(Y)/No(N)) :”);
scanf(“%s”,&pil);
}
while (pil == ‘y’|| pil == ‘Y’);
/* clrscr(); */
footer();
}
- Follow us on Twitter, or subscribe to the rizqtech RSS Feed for more daily web development and articles.
Enjoy this Post!
May 3rd, 2010 at 1:56 am
ya .. saya coba lagi pak…!!!!!