Friday 9th Sep – Quick Sort Middle Item Algorithm, Binary Search and Bin Packing Algorithms

LEARNING OBJECTIVE: to discover and practice the following algorithms: Quick Sort Middle item, Binary Search, Bin Packing - First Fit, First Fit Decreasing and Full Bin

Success criteria: You will be able to apply all the algorithms efficiently .

Quick Sort middle Item

Binary Search

Bi Packing – First Fit, Bin Packing Full Bin

Bin Packing First Fit Decreasing

Homework Ex A,B,C D,E from Chapter 1

Hanson (and Sam?) Work through Q1 to 7 pages 77 and 78 of old D1 text Book