• # Revision:Packing Algorithms

TSR Wiki > Study Help > Subjects and Revision > Revision Notes > Mathematics > Packing Algorithms

## First Fit

Work along the list, putting items in the first place where they fit. Remember you can go back and fill previous gaps if later pieces fit.

## First Fit Decreasing

Start by sorting the items into decreasing order. Then proceed to work along the (newly ordered) list as with First Fit.

## Example

Tapes last 45 minutes. The songs to be recorded on the tapes have the following durations, in minutes.

8 4 5 3 6 9 4 10 7 12 5 8 4 5

The total duration is exactly 90 minutes. Can the songs be fitted onto 2 tapes?

### Using First Fit

3 tapes are needed.

### Using First Fit decreasing

2 tapes are needed.

12 10 9 8 8 7 6 5 5 5 4 4 4 3

However neither method always gives the optimal solution.

## Also See

See the other D1 notes:

Try Learn together, TSR's study area

47,119
revision notes

55,943
mindmaps

59,075
crosswords

18,555
quizzes

create
a study planner

thousands
of discussions

Today on TSR

### Which business legend are you?

We have the answer...

### Last one to post wins!

Poll

The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE