Created
January 26, 2016 22:35
-
-
Save vapaternina/7e2dd57c380592408338 to your computer and use it in GitHub Desktop.
Elemento de mayor frecuencia en un vector, cuando hay 1 que obligatoriamente cumple ese parámetro.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
///--------@Autor: Victor Paternina----------/// | |
///--------@Fecha: 26/01/2016 - 5:28pm-------/// | |
#include <iostream> | |
using namespace std; | |
void maxRepeticiones(int vector[],int tam){ | |
int cont; | |
int max_rep; | |
int cant_mayor = 0; | |
for(int i=0;i<tam;i++){ | |
cont = 0; //Reiniciar variable para volver a usar el contador | |
for(int j=i;j<tam;j++){ | |
if(vector[i] == vector[j]){ | |
cont++; | |
} | |
} | |
if(cont > cant_mayor){ | |
cant_mayor = cont; // Reasignar la cantidad mayor para determinar el numero con mayor repeticiones | |
max_rep = vector[i];// Asignar el numero con mayor repeticiones. | |
} | |
} | |
cout << "El numero con mayor frecuencia dentro del vector es: " << max_rep << " con: " << cant_mayor << " repeticiones."; | |
} | |
int main(){ | |
//Ejemplo de uso | |
int n = 20; | |
int vector[20] = {7,7,7,7,6,7,2,3,7,7,7,3,3,3,3,7,7,3,3,3}; | |
maxRepeticiones(vector,n); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment