0
Still curious? Ask our experts.
Chat with our AI personalities
Lao
Ross
MaxinePseudo-code:
Made a variable to hold the largest number.
Assume the largest number is the first one. Assign number to variable.
Go to next number. If it is greater, assign the new number to variable.
Continue until you run out of numbers.
Java:
int[] arr = {2, 10, -2}; // Array of numbers
int max = arr[0]; // assume the max is the first number
for(int k = 1; k < arr.length; k++) // traverse starting with the second element
{
if( arr [k] > max) // if the value checked is greater than my current max
max = arr[k]; // reassign my max
}
C++:
I totally did not steal and make minor changes to this code to make it work in C from anyone...
int arr[] = {2, 10, -2}; // Array of numbers
int max = arr[0]; // assume the max is the first number
for(int k = 1; k < 3; k++) // traverse starting with the second element
{
if( arr [k] > max) // if the value checked is greater than my current max
max = arr[k]; // reassign my max
}
Edit: Here's a more efficient c++ method from luke s.
for(int i=0;i<=2;i++){
cout << "Enter number " << i+1 << ": ";
cin >> num[i];
if(num[i]>num[i-1]){high=num[i];}
}
The simplest algorithm employs a function to find the largest of two values. The return value can then be input to the same function along with the third value to determine the largest of three values:
// return largest of 2 values
int max(int a, int b) {return a<b?b:a;}
// return largest of 3 values
int max(int a, int b, int c) {return max(max(a,b),c);}
The function can be overloaded to cater for any number of values simply by calling the previous overload:
// return largest of 4 values
int max(int a, int b, int c, int d) {return max(max(a,b,c),d);}
Although you can provide as many overloads as desired, it would be simpler to use an overload that accepts a vector of values:
int max(std::vector<int>& v)
{
if (v.empty())
throw std::range_error("max(std::vector<int>&): range error!");
int m = v[0];
for (size_t i=1; i<v.size(); ++i) m=max(m,v[i]);
return m;
}
It is hard. Very hard. Actually, it requires a genius.
avg = (x+y+z)/3
could also be
1.) Start
2.) Detrmine the first number; call it A
3.) Detrmine the second number; call it B
4.) Detrmine the third number; call it C
5.) Detrmine the number if integers; call it D
6.) Find the sum of A,B and C; call it X
7.) Divide X by D; call it the RESULT
8.) Present the RESULT
9.) Stop
Algorithm to find the largest of three numbers
Compare the first two numbers to find the larger of the two. Then compare the larger number with the third number to find the largest of all three.
Expressing this algorithm as a simple function in C:
int Largest( int num1, int num2, int num3 ){
return( num1 > num2 ? ( num1 > num3 ? num1 : num3 ) : ( num2 > num3 ? num2 : num3 ));
}
To find the largest of three numbers you first need to find the largest of two numbers. That algorithm is extremely trivial:
Algorithm: largest_of_two
Input: two numeric values, a and b
Output: the value of a or b, whichever is the largest
if a > b then
return a
else
return b
Having established the largest of two, we can use this algorithm to establish the largest of three:
Algorithm: largest_of_three
Input: three numeric values, a, b and c
Output: the value of a, b or c, whichever is the largest
return largest_of_two (largest_of_two (a, b), c)
We could extend the algorithm to cater for any number of values, however there is a much simpler approach. First, place all the values in a container such as an array. Store the first value then compare all other values with the stored value. If the current value is larger, replace the stored value with the current value. When all values have been compared, the stored value holds the largest value.
Algorithm: largest_of_many
Input: an array of values, A
Output: the largest value in A
store := A[0] // store the first value
for i = 1 to size(A) - 1 // loop through all remaining values
if A[i] > store then store := A[i] // if the current value is larger, store it
end for
return store
Add your answer:
Earn +20 pts
What is the algorithm for average of three numbers?
int secondmax (int a[], int n){int i, max, second;for (i=0; imax) second= max, max= a[i];else if (i==1 a[i]>second) second= a[1];}return second;}int middle (int a[3]){return secondmax (a, 3);}
What are the rules of algorithm?
An algorithm is a set of instructions that tells something (in this case, a computer) how to complete a specific task. An algorithm can be as simple as the following: 1. Move hand to wrench.2. Pick up wrench.3. Move wrench over to bolts.4. Turn wrench clockwise five times.5. Move wrench to original location.6. Let go of wrench.However, algorithms can be extremely complex and resource-intensive depending on the task you are trying to accomplish.
Write the program in qbasic and add two numbers?
Cls input "enter two no.s ",a,b sum=a+b print "sum = ";sum end
What is the algorithm for 3 x 8?
You basically multiply 3 with 8 and 3 X 8 = 24
What is are advatages and disadvatages of bresenham's line algorithm?
1. High accuracy. Comparing to Basic Incremental algorithm (especially if the slope were > 1.) 2. High speed. Comparing to Digital Differenmtial algorithm. 3. Draws the line between any two points. Comparing to Basic Incremental algorithm which can't draw if x0 > x1 ( the format is: (x0, y0), (x1, y1). )
