0.8 0.04 0.53
I believe the answer is: 7,7,11
0.27, 0.99, 1.8, 2.01
0.05, 0.5, 5.5, .55
1.6, 6.1, 6.166, 6.61, and 6.66.
0.006, 0.008, 0.081, 0.091, 0.095, 0.0.8, 0.09, 0.1
just go the reverse of how they are listed now they are currently largest to smallest
I believe the answer is: 7,7,11
5678 + 8765 = 14443 would yield the largest possible sum.
0.001 0.05 0.2 0.5 3.3 5.2
0.05, 0.5, 5.5, .55
0.27, 0.99, 1.8, 2.01
A sentence using the names of the largest and smallest continents would be "Sarah is going on a tour of the world and she going to visit Asia and Australia. North America is the 3rd largest continent.
1.6, 6.1, 6.166, 6.61, and 6.66.
#include #include #include int main(int argc, char *argv[]){int n, smallest, largest, sum, temp;if(argc < 2){printf("Syntax: foo val1[val2 [val3 [...]]]\n");exit(1);}smallest = largest = sum = atoi(argv[1]);for(n = 2; n < argc; n++){temp = atoi(argv[n]);if(temp < smallest) smallest = temp;if(temp > largest) largest = temp;sum += temp;}printf("Smallest: %i\nLargest: %i\nAverage: %i\n", smallest, largest, sum / (argc - 1));return 0;}
smallest: zero largest: five thousand
Use the following algorithm (written in pseudocode). Let largest be the lowest possible real number. Let smallest be the greatest possible real number. Repeat while there is input... { Read real number r from input. If r is greater than largest then let largest be r. If r is less than smallest then let smallest be r. } End repeat. Let range be largest minus smallest. Output range.
write these numbers in order of size smallest first 2177 914 941 944 909