Professional Documents
Culture Documents
Untitled
Untitled
Main.cpp
#include <iostream>
#include "Cari.h"
using namespace std;
int main(void){
int arr[] = {5,3,50,10,40};
int x = 50;
int n = sizeof(arr) / sizeof(arr[0]);
Cari cariNilai;
int hasilPencarian = cariNilai.linearSearch(arr, n, x);
(hasilPencarian == -1)?
cout<<"Elemen tidak ditemukan didalam array"
:cout<<"Elemen ditemukan pada indeks ke-"<<hasilPencarian;
return 0;
}
Cari.h
#include <iostream>
class Cari{
public:
int linearSearch(int arr[], int n, int x);
};
Cari.cpp
#include "Cari.h"
#include <iostream>
Main.cpp
#include <iostream>
#include "Cari.h"
using namespace std;
int main(void){
int arr[] = {2,3,4,5};
int x = 4;
int n = sizeof(arr) / sizeof(arr[0]);
Cari cariNilai;
int hasil = cariNilai.binarySearch(arr, 0, n-1,x);
(hasil == -1)?
cout<<"Elemen tidak ditemukan didalam array"
:cout<<"Elemen ditemukan pada array indeks ke-"<<hasil;
return 0;
}
Cari.cpp
#include <iostream>
#include "Cari.h"
using namespace std;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, mid-1, x);
return binarySearch(arr, mid+1, r, x);
}
return -1;
}
Cari.h
#ifndef CARI_H
#define CARI_H
class Cari{
public:
int binarySearch(int arr[], int l, int r, int x);
};
#endif // CARI_H
5.3
Main.cpp
#include <iostream>
#include "BinarySearch.h"
using namespace std;
int main(){
int arr[] = {90,59,55,43,33,21,11};
int n = sizeof(arr)/sizeof(arr[0]);
int x = 90;
BinarySearch cariN;
int hasil = cariN.cari(arr,0,n-1,x);
if(hasil == -1)
cout<<"Elemen tidak ditemukan dalam array";
else
cout<<"Elemen ditemukan di index ke-"<<hasil;
return 0;
}
BinarySearch.cpp
#include "BinarySearch.h"
if(arr[mid] == x)
return mid;
if(arr[mid] < x)
r = mid - 1;
else
l = mid + 1;
}
return -1;
}
BinarySearch.h
#include <iostream>
class BinarySearch{
public:
int cari(int arr[],int l,int r,int x);
};