Algorithms, bin packing and sorting Flashcards
Studying this course? Keep your progress in one place.

Flip each card. Be honest: the ones you mark Not yet come back first.
12 cards
Tap a card to flip it. Swipe right if you knew it, left if not.
See all 12 cards
- What is an algorithm?
- A finite, unambiguous sequence of instructions that solves a problem.
- What does the order of an algorithm describe?
- How the running time grows with the size of the problem for large .
- Order of bubble sort?
- , from comparisons.
- Number of comparisons for bubble sort on items?
- .
- If time is of order and is multiplied by 10, the time is?
- Multiplied by about 100.
- What does first-fit do?
- Places each item, in the given order, into the first bin with room.
- What does first-fit decreasing do?
- Sorts the items into descending order, then uses first-fit.
- How do you find the lower bound for bin packing?
- Total size capacity, rounded up.
- What is the full-bin method?
- Find combinations of items that exactly fill a bin and pack these first.
- What does one pass of bubble sort achieve?
- The largest unsorted item ends up in its final position.
- Pivot position in quick sort for ?
- th item.
- Pivot position in quick sort for ?
- th item.