Draw a flowchart to find greater and smaller number from given two numbers?

Answer 1

It's not easy to show a flow chart using a text-based forum. Instead, I'll show the algorithm using pseudocode. You should be able to draw a flowchart from this.

1. let largest=0
2. let number=first_number
3. if number
4. let largest=number
5. if number=last_number then goto 8
6. number=next_number
7. goto 3
8. return largest

Answer 2

This a text-based forum. We can't "draw" anything. All we can do is describe the procedure in words.

To find the maximum in a set of numbers, store the first value, then iterate through the remaining values, comparing each with the one that you stored. If the stored value is less than the current value, replace the stored value with the current value. When you've iterated through all the values, the stored value will contain the largest value.

In C++, you'd use the following function to determine the largest value in the given array, A, of the given size:

int max(int A[], size_t size)

{

int result=0;

if( size )

{

result=A[0];

for(int i=1; i<size; ++i )

if(result<A[i])

result=A[i];

}

return(result);

}

Answer 3

There are special flow-chart rulers that help you to draw the different boxes.

first draw the box and writ as start, and draw a arrow and draw input box and write as "Input first no as (A)","Input second no as (B)","input third no as "C".

and draw a arrow, and draw a decision box and give as " if A>B". and draw two line as correct"yes" and false"no". Ongoing of "yes" arrow draw a process and type "A=X" to express "A" 's value as "x" 's value. so x=a, and Ongoing of "no" arrow draw a process and type "B=X" to express "B" 's value as "x" 's value. so x=b, and get the outer two arrow of the processes and connect together. and connect that to a new function as"X>C" if yes type in the output box as Print "X" . if not Print "c". and conect the outer arrows as the end box...........

i used here that only two function boxes here. if u have any doubts pls contact me via my mail.............

(ahamedzaki19981010@gmail.com)

(+94) 777 353 623

Answer 4

It is not possible to draw a flowchart here, however we can show you the algorithm in pseudocode which should help you to draw your own flowchart:

Algorithm: get_rangeis:

Input: a zero-based array of n values, v[n], such that n>0

Output: the min and max values in the closed range v[0:n-1]

let min := v[0]

let max := v[0]

for i := 1 to n-1

if v[i] < min then

let min := v[i]

else if v[i] > max then

let max := v[i]

end if

next i

return min, max

Answer 5

itanong mo sa matalino mong kaklaseng si ralen alam nya yan 4 sure may bayad nga lang hakhakhak

Answer 6

itanong mo sa matalinong mong kaklaseng si ralen :) alam nya yan 4 sure

Answer 7

max & min of a number is the number itself.

no flowchart required

Answer 8

1ekar=