0
As written in the C Programming language to find the LCM for up to 50 numbers. All that needs to be done is compile this. It is my first draft of the program, as it was due for a class 2 hrs ago, but if you wish to try and optimize it, that's your task.
-----------------------------------------------------------------------------------------------------------
#include <stdio.h>
#define NUMFACT 50
void FindFactor(int[]);
int Min(int[]);
int Max(int[]);
int calc(int[]);
int check(int[]);
void bubbleSort(int[]);
void Display(int[],int);
int main()
{
int factors[NUMFACT] = {0}; //FACTORS ARRAY INITIALIZED WITH 0'S
int lcf; //LOWEST COMMON FACTOR
FindFactor(factors);
lcf = calc(factors);
bubbleSort(factors);
Display(factors, lcf);
return(0);
}
void FindFactor(int factors[])
{
int tempvalue; //TEMP VALUE TO BE STORED IN FACTOR ARRAY
int location = 0; //LOCATION IN VECTOR TO PLACE INPUT NUMBER
do
{
printf("Enter factor: ");
scanf("%d",&tempvalue);
if (tempvalue != -1)
{
factors[location] = tempvalue;
}
++location;
} while (tempvalue != -1 && location <=49);
}
int Min(int factors[])
{
int increment; //INCREMENT EACH PASS
int min = Max(factors); //MAX VALUE IN FACTORS CHANGED TO LOWEST
int location; //LOCATION OF THE MIN VALUE IN ARRAY
for(increment = 0 ; increment < 49 ; increment++)
{
if (factors[increment] != 0)
{
if(factors[increment] < min)
{
min = factors[increment];
}
}
}
for(increment = 0 ; increment < 49 ; increment++)
{
if(min 0);
lcf = copyfactors[0];
return(lcf);
}
int check(int factors[])
{
int increment; // INCREMENT EACH PASS
int value = 1; //TRUE VALUE RETURNED IF IF-LOOP IS ALWAYS FALSE
for(increment = 1 ; increment < 49 ; increment++)
{
if (factors[increment] != 0)
{
if (factors[increment-1] != factors[increment])
{
value = 0;
}
}
}
return(value);
}
int Max(int factors[])
{
int max = 0; //START VALUE SINCE # CAN'T BE LESS THAN 0
int increment; //INCREMENT EACH PASS
for(increment = 0 ; increment < 50 ; increment++)
{
if (factors[increment] > max)
{
max = factors[increment];
}
}
return(max);
}
void bubbleSort(int factors[])
{
int numPasses; //LCV THAT CONTROLS # OF PASSES
int lcv; //LOOP CONTROL VARIABLE FOR SORTING
int temp; //HOLDS VALUE DURING SWAP
for(numPasses = 1; numPasses < NUMFACT ; numPasses++)
{
for(lcv = 0 ; lcv < NUMFACT - numPasses ; lcv++)
{
if(factors[lcv] > factors[lcv+1])
{
temp = factors[lcv];
factors[lcv] = factors[lcv+1];
factors[lcv+1] = temp;
}
}
}
}
void Display(int factors[],int lcf)
{
int increment; //INCREMENT EACH PASS
printf("The factors of %d are:",lcf);
for(increment = 0; increment < 50 ; increment++)
{
if(factors[increment] != 0)
{
printf(" %d",factors[increment]);
}
}
printf("\n");
}
Still curious? Ask our experts.
Chat with our AI personalities
Blake
Taiga
RossAdd your answer:
Earn +20 pts
What is the GCD of two negative numbers?
Since negative numbers also have positive factors, their GCF would be the same as if the original numbers were positive.
What is the GCD of 290 609?
The Greatest Common Divisor (GCD) for 290 609 is 29
What do LCM and GCF mean?
Factors go into numbers, numbers go into multiples. The greatest common factor, or GCF, is the largest positive integer that will divide evenly with no remainder into all the members of a given set of numbers. The least common multiple, or LCM, is the smallest positive integer that all the members of a given set of numbers will divide into evenly with no remainder.
What is the gcd of 40 and 35?
The Greatest Common Divisor (GCD) for 40 35 is 5.
What is the GCD of 42 and 56?
The Greatest Common Divisor (GCD) for 42 56 is 14.
