int findSmallest(int *list, int listsize)
{
int i;
int smallest = list[0];
for(i = 1; i < listsize; i++)
{
if(list[i] < smallest)
smallest = list[i];
}
return smallest;
}
When you are given some numbers just arrange them in ascending order and you will the smallest number which can be made out of those given numbers.
k
syntax error
You need at least two numbers to find an LCM, which is the smallest positive integer that all the members of a given set of numbers will divide into evenly with no remainder.
The smallest is 0o0'0'' and the largest is 180o0'0''
the two smallest numbers are 49 and 14
for(int i = 1; i < 100; i+=2) { System.out.println(i); }
Count all the given numbers then count all the numbers of a given value. Divide one by the other and multiply by 100. For instance, if there are 50 numbers in total and 5 of them have the value 42, then the percentage of numbers with the value 42 is 5 / 50 * 100 = 10%.
helicopter
program to find maximum of two numbers using pointers
what is if(!(str[i]==32))
VBnet program to find the prime numbers between 100 to 200?