Assignment: Algorithm Complexity Issues
In this weeks summary, the dispatch department has contacted you with a new problem. Once they receive a new order, they have to look for each product's availability in the existing warehouses. The preference is to ship from the minimum amount of warehouses and to always ship from the warehouse that contains the maximum amount of units.
For example, review the following order (number 10333) that was received by the dispatch department this morning:
|
Product ID
|
Amount
|
|
0001
|
10
|
|
0005
|
12
|
|
0003
|
3
|
|
0002
|
4
|
Be sure to also review the following diagram that shows the warehouse and the list of available products:
|
|
Warehouse 1
|
Warehouse 2
|
Warehouse 3
|
|
Product 001
|
10
|
3
|
100
|
|
Product 002
|
0
|
7
|
6
|
|
Product 003
|
3
|
4
|
1
|
|
Product 004
|
4
|
4
|
4
|
|
Product 005
|
7
|
1
|
4
|
The ideal shipment would be as follows:
|
Product ID
|
Units
|
Warehouse
|
|
0001
|
10
|
1
|
|
0005
|
7
|
1
|
|
1
|
2
|
|
4
|
3
|
|
0003
|
3
|
2
|
|
0002
|
4
|
2
|
Complete the following:
• What approach would you follow to create an algorithm to solve this particular problem? Brute force or greedy? Explain the logic that you follow for your choice.
• Present the algorithm either using pseudocode or a flowchart.