CSE 214 Lecture 5: Lecture5-ADTContinued
9 Sep 2016
School
Department
Course
Professor
Document Summary
Only submit . java files or points will be deducted. An invariant is a condition that remains true before and after some operation is performed (i. e precondition = postcondition) All the methods of an adt (except the constructors) must ensure that the invariant of the adt is valid before and after the execution. Let data = array that holds the bag items. Let data. length = the capacity of the array. Let manyitems = the number of items in the bag (i. e its size) The elements of a bag are stored in data[0 manyitems-1]. manyitems <= data. length. Public class intarraybag implements cloneable private int[] data; private int anyitems; Src = reference of array to copy from. Dest = reference of array to copy to. Di = starting position of array to copy to. N = number of items that will be copied over. Arraycopy: best case: o(1) if nothing is done.
