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 buscaSequencial(int v[],int x[], int n, int k){
- int i, cont = 0, j = 0;
- for(i = 0; i < n; i++){
- if(v[i]== k){
- cont++;
- x[j] = i;
- j++;
- }
- }
- return cont;
- }
- int buscaBinaria (int v[], int n, int k) {
- int i = -1, j = n;
- while (i < j -1 ) {
- int m = (i + j)/2;
- if (v[m] < k) i = m;
- else i = m;
- }
- return j;
- }
- int main(){
- int n = 1000, k, cont = 0;
- int v[n],x[n], y[n];
- for(int i = 0; i < n; i++){
- x[i] = -1;
- y[i] = -1;
- }
- printf("digite o numero a ser buscado: ");
- scanf("%d", &k);
- for(int i = 0; i < n; i++){
- v[i] = rand() % 1000;
- }
- printf("a quantidade de vezes eh: %d\n", buscaSequencial(v,x, n, k));
- for(int i = 0; i < n; i++){
- if(x[i] > -1)
- printf("%d ", x[i]);
- }
- ordenar(v,n);
- // for(int i = 0; i <n; i++){
- // printf("|%d| ", v[i]);
- // }
- // printf("a posicao eh %d", buscaBinaria(v, n, k));
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement