Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include <stdlib.h>
- #include <string.h>
- void binarno_prebaruvanje(int *niza, int n, int x) {
- int leva_granica = 0;
- int desna_granica = n - 1;
- while(leva_granica <= desna_granica) {
- int sredina = (leva_granica + desna_granica) / 2;
- if(*(niza + sredina) == x) {
- printf("Brojot postoi\n");
- return;
- }
- if(*(niza + sredina) < x) {
- leva_granica = sredina + 1;
- }
- else {
- desna_granica = sredina - 1;
- }
- }
- printf("Ne e najdeno");
- }
- int main(){
- int n ;
- scanf("%d", &n);
- int niza[100];
- for(int i = 0; i < n; i++){
- scanf("%d", &niza[i]);
- }
- int x;
- scanf("%d", &x);
- binarno_prebaruvanje(niza, n, x);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment