Algorithm for placing one item
- This algorithm should be sent the 2D array and one item.
- Assume there there is space available
- Start with the 0'th ship
- While there is space, you have not placed the item, and you have not checked every ship
- Start with the 0'th container on the current ship
- While it is not placed and you have not checked every container on the current ship
- If there is room
- place it
- indicate that you found where to place it
- otherwise go to the next container
- if need be go to the next ship
- if never placed that means there was no room
This topic: CenterForComputing
> WebHome >
Syllabi >
CSC121SylF2023 >
CSC121F2023Lab11 > CSC121F2023Lab11Hint1
Topic revision: r2 - 2024-03-05 - CathyBareiss