Scribd
Upload
11 views3 pages

Tugas 9

The document contains code for a searching algorithm in C++. It defines variables to store an array of integers entered by the user up to 100 elements, the data to search for, and a boolean variable to track if the data is found. It then uses a while loop to sequentially search through the array until it either finds a matching element or reaches the end. If found, it prints the index, otherwise it indicates the data was not found.

Uploaded by

Dwi Imam Prasetyo
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views3 pages

Tugas 9

The document contains code for a searching algorithm in C++. It defines variables to store an array of integers entered by the user up to 100 elements, the data to search for, and a boolean variable to track if the data is found. It then uses a while loop to sequentially search through the array until it either finds a matching element or reaches the end. If found, it prints the index, otherwise it indicates the data was not found.

Uploaded by

Dwi Imam Prasetyo
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Miqdad Santosa P

11650049
TUGAS SEARCHING
#include"iostream"
#include"conio.h"
using namespace std;
#define true 1
#define false 0
#define boolean unsigned char
int l[100], x, idx;
main(){
int i=0, d;
boolean ada;
cout<<"Masukkan Data [max 100] : "; cin>>idx;
for(d=1; d<=idx; d++){
cout<<"Data ke-"<<d<<" : "; cin>>l[d];
}
cout<<"Data yang akan dicari : "; cin>>x;
i=0;
ada=false;
while((i<=idx) && (!ada)){
if(l[i]==x)
ada=true;
else
i=i+1;
}
if(ada)
cout<<"Data "<<x<<" ditemukan di indeks ke-"<<i<<endl;
else
cout<<"Data "<<x<<" tidak ditemukan!!!\n";
getch();
}

#include"iostream"
#include"conio.h"
using namespace std;
#define true 1
#define false 0
#define boolean unsigned char
int l[100], x, n, idx;
void tukar(int a, int b){
int t=l[b]; l[b]=l[a]; l[a]=t;
}
void insertion_sort(){
int temp, j;
for (int i=1; i<idx; i++){
temp=l[i]; j=i-1;
while(l[j]>temp&&j>=0){
l[j+1]=l[j]; j--;
}
l[j+1]=temp;
}
}
int main(){
int i=0, d;
boolean ketemu;
cout<<"Masukkan Data [max 100] : "; cin>>idx;
cout<<"---------------------------------\n";
for(d=0; d<idx; d++){
cout<<"--> Data ke-"<<d+1<<" : "; cin>>l[d];
}
insertion_sort();
cout<<"\n+-----------------------+\n";
cout<<"+ DATA HASIL SORTING +\n";
cout<<"+---------------+-------+\n";
for(d=0; d<idx; d++){
cout<<"| Data ke-"<<d+1<<" \t| "<<l[d]<<"\t|\n";
}
cout<<"+---------------+-------+\n";
cout<<"\nData yang akan dicari : "; cin>>x;
i=0; ketemu=false;
while((i<idx)&&(!ketemu)){
if(l[i]==x) ketemu=true;
else i++;
}
if(ketemu)
cout<<"Data "<<x<<" ditemukan di indeks ke-"<<i+1<<endl;

else
cout<<"Data "<<x<<" tidak ditemukan!!!\n";
getch();
}

You might also like