Queue1 get(): checks for max size instad of checking for zero size Queue2 put(): check for max size misplaced Queue3 put(): missing check for max size Queue4 put(): missing write to data array Queue5 put(): size is incremented even if queue is full Queue6 get() and put(): no modulo, will stop working after 4096 insertions Queue7 get(): size is decremented but element is not removed Queue8 get(): size is not decremented Queue9 implements a LIFO stack Queue10 implements a priority queue Queue11 implements a FIFO queue with removal of duplicate elements Queue12 implements a FIFO queue of unbounded size Queue13 correct Queue14 put(): drops n and inserts size (as an element) instead Queue15 get(): no modulo Queue16 get(): no checks for size in get Queue17 get(): division by 0 in the check for the size in put) Sort1 changes the multiplicity (x y y -> x x y) Sort2 incorrect bubble sort Sort3 uses a set (and thus looses multiplicity) Sort4 sorts then duplicates one element Sort5 sorts then swaps two elements Sort6 access out of bounds Sort7 correct (Arrays.sort) Sort8 insertion sort with a buggy test Sort9 bubble sort with a missing step Sort10 quicksort with a missing swap Sort11 quicksort with an incorrect recursive call Sort12 mergesort with an incorrect recursive call Sort13 sorts then inserts 42 (the array remains sorted) Sort14 insertion sort with j-- instead of --j