How to show the number that most appears in a vector in the C language?

Question

How to show the number that most appears in a vector in the C language?

Navigation

#1 by (0 votes)
#2 by (0 votes)

-5

Given a sequence of N numbers between 0 and 100. Determine which is the highest frequency value.
Here's what I've done so far:

#include <stdio.h>
#define max 100

int main()
{    
    int vetor[max],i,j,frequencia=0,maior=0,tamanho_vetor,cont=0;    

    scanf("%d",&tamanho_vetor);

    if(tamanho_vetor>=1 && tamanho_vetor<=1000000)
    {
        for(i=0; i<tamanho_vetor; i++)    
        {
            scanf("%d",&vetor[i]);

           /* Como vou fazer a comparação, para achar o numero que mais aparece e quantas vezes ele aparece? */

                 if(vetor[i]==)    
                {
                    cont++;
                    frequencia ;
                }                
        }
        printf("%d %d\n",frequencia,cont);
    }

    else
        return 0;    
}

c

asked by anonymous 25.05.2018 / 20:00

2 answers

0

I'll send a code that returns the highest frequency of numbers, but that is used for a small range of numbers, I know you want to return the frequency with a larger range of numbers, so you will have to first sort the numbers by selection and then take off the fashion, which is the largest number that repeats.

# include <stdio.h>
# include <stdlib.h>


int main() {

int vetor[10];
int j=0;
int tamanho;
int c = 0;
int i = 0;

for (i = 0; i <= 11; i++)
 vetor[i] = 0;

printf("Digite quantidades de numeros que deseja procurar:\n");
 scanf("%d >>", &tamanho);

for (j = 0; j < tamanho; ++j){
 scanf("%d", &c);
 vetor[c]++;
}


int moda = 0;

for (c = 1; c <= tamanho; c++) {
 if (vetor[c] > vetor[moda])
     moda = c;
}

printf("A moda dos valores e': %d", moda);


return 0;
}

25.05.2018 / 22:09

Java Script Error ")" How to insert XML data inside a MYSQL database?

score 0 · Accepted Answer

Try this:

#include <stdio.h>
#include <stdlib.h>

int main(int argc, char* argv[])
{
    int balde[100];
    //int* amostra;
    int x;
    int n;
    int i;
    int maiorBalde;

    // Esvazia os baldes.
    for (i = 0; i < 100; ++i)
    {
        balde[i] = 0;
    }

    printf("Digite o tamanho da amostra (0 para sair): ");
    scanf("%d", &n);

    if (n)
    {
        //amostra = (int*)malloc(n * sizeof(int));

        fflush(stdin);
        printf("Digite os %d numeros (entre 0 e 100) separados por espacos: ", n);
        for (i = 0; i < n; ++i)
        {
            scanf("%d", &x);
            //amostra[i] = x;
            ++balde[x - 1];
        }

        // Escolhendo o x que tem o maior balde.
        maiorBalde = 0x80000000;
        for (i = 0; i < 100; ++i)
        {
            if (maiorBalde < balde[i])
            {
                maiorBalde = balde[i];
                x = i + 1;
            }
        }

        // Imprime x.
        printf("O valor com maior frequencia e %d, com %d de frequencia\n",
            x, maiorBalde);

        //free(amostra);
    }
}