Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- void ordenar(int v[], int n){
- int i, aux;
- for(int j = 0; j < n; j++){
- for(i = 0; i < n; i++){
- if(v[i] > v[i + 1]){
- aux = v[i];
- v[i]= v[i + 1];
- v[i + 1] = aux;
- }
- }
- }
- }
- int buscaBinaria (int v[], int v1[], int n) {
- int i = -1, j = n;
- while (i < j -1 ) {
- int m = (i + j)/2;
- if (v[m] < v1[1]) i = m;
- else i = m;
- }
- return j;
- }
- int main(){
- int n, q, j, x, y;
- y = n + q;
- scanf("%d %d", &n, &q);
- j = n + 1;
- int v[y];
- for(int i = 0; i < y; i++){
- v[i] = rand()%10;
- }
- int v1[q];
- for(int i = 0; i < q; i++){
- v1[i] = j;
- j++;
- }
- ordenar(v, n);
- if(x = buscaBinaria(v, v1, y) > -1)
- printf("%d found at %d", v1[1], buscaBinaria(v, v1, y));
- else
- printf("%d not found", v1[1]);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement