```
#!/usr/local/bin/python3
import sys
def print_factorial( user_val ):
if( user_val < 1 ):
return( 1 )
else:
return( print_factorial( user_val - 1 ) * user_val )
if( __name__ == "__main__" ):
if( len( sys.argv ) == 2 ):
print( print_factorial( int ( sys.argv[ 1 ] ) ) )
else:
sys.stderr.write( "usage: %s <integer>\n" % sys.argv[ 0 ] )
exit( 0 )
```
Cheese
…………………………..tggggggcfcgvgvv
Answer:
weight_pounds=float(input("Enter the weight in pounds:\n"))#taking input of weight.
height_inches=float(input("Enter the height in inches:\n"))#taking input of thye height.
bmi=(weight_pounds/(height_inches**2))*703#calculating the bmi.
print('The body mass index is '+str(bmi))#printing the result.
Ouput:-
Enter the weight in pounds:
207.8
Enter the height in inches
:
72
The body mass index is 28.163395061728398
Explanation:
The above written program is in python.First I have taken input from the user of the weight in pounds then taking input of the height in inches.Then calculating the bmi and storing it in the variable bmi.Then printing the bmi in the end.
After the recursive sorting step, merge sort does not need to combine the sorted sub-arrays.
<h3>What is merge sort?</h3>
Merge sort is an efficient, general-purpose, comparison-based sorting algorithm in computer science.
Most implementations yield a stable sort, which means that the order of equal elements in the input and output is the same.
Merge Sort can be used to sort linked lists. Merge Sort is a stable sort, which means that the same element in an array retains its original position in relation to the others.
Thus, a merge sort does not need to combine the sorted sub-arrays after the recursive sorting step.
For more details regarding a merge sort, visit:
brainly.com/question/13152286?referrer=searchResults
#SPJ4
