A shop had N number of sales each day for M days. Each day different types of items were sold and had different profits associated with them, but the quantity of items sold each day was the same. The owner of the shop wishes to know the minimum profit made each day. For this, a structure was formed in which profit for all different items for an individual day was kept in the same column for M days. Write an algorithm to find the minimum profit for each day individually.
Answers
Answer:
h. m h y d c n r rg all allowed who is pm of the india and Afghanista
Explanation:
shop had N number of sales each day for M days. Each day different types of items were sold and had different profits associated with them, but the quantity of items sold each day was the same. The owner of the shop wishes to know the minimum profit made each day. For this, a structure was formed in which profit for all different items for an individual day was kept in the same column for M days. Write an algorithm to find the minimum profit for each day individually.
Answer:
Josh went to the market to buy N apples. He found two shops, shop A and B, where apples were being sold in lots. He can buy any number of the complete lot(s) but not loose apples. He is confused with the price and wants you to figure out the minimum cost to buy exactly N apples. Write an algorithm for Josh to calculate the minimum cost to buy exactly N apples.