Answer:
Following are the solution to this question:
Explanation:
This algorithm uses the divide and rule approach works, which splits the list into two sublists depending on if they are smaller or larger than the pivotal factor. It has O(n*log n) complexity.
It splits down the list in more than one version frequently till every sublist becomes based on a single element and fuses it to offer an ordered array. The merge type works according. It has O(n*log n) complexity.
Please find the attachment file of the sorting.
Answer:
product_name = input("Enter product name : ")
if product_name=="pen"or"book"or"box"or"pencil"or"eraser":
if product_name == "pen":
amount = 10
print(f"Product Name: {product_name}\nCost: {amount} rupees")
if product_name == "book":
amount = 100
print(f"Product Name: {product_name}\nCost: {amount} rupees")
if product_name == "box":
amount = 150
print(f"Product Name: {product_name}\nCost: {amount} rupees")
if product_name == "pencil":
amount = 5
print(f"Product Name: {product_name}\nCost: {amount} rupees")
if product_name == "eraser":
amount = 8
print(f"Product Name: {product_name}\nCost: {amount} rupees")
else:
print("Item not found!")
Explanation:
The python program is a code of nested if-statements that compares the input string to five items of the first if-statement. For every item found, its code block is executed.
Task view
I hope this helps you :)
Answer:
nothing it's perfect in the way it is
Explanation:
