class ArraySortedList(object): """ Array-based implementation of a sorted list.""" def __init__(self): self._items = ArrayIndexedList() def __len__(self): return len(self._items) def isEmpty(self): return self._items.isEmpty() def __str__(self): return str(self._items) def __iter__(self): return iter(self._items) def __getitem__(self, index): """Preconditions left as an exercise.""" return self._items.get(index) def remove(self, index): """Preconditions left as an exercise.""" return self._items.remove(index) def insert(self, item): """Inserts item in its proper place.""" index = 0 while index < len(self) and \ item > self[index]: index += 1 self._items.insert(index, item) def index(self): """Returns the index of the given item or -1 if it is not found.""" pass #Exercise: uses a binary search
class ArraySortedList(object): """ Array-based implementation of a sorted list.""" def __init__(self): self._items = ArrayIndexedList() def __len__(self): return len(self._items) def isEmpty(self): return self._items.isEmpty() def __str__(self): return str(self._items) def __iter__(self): return iter(self._items) def __getitem__(self, index): """Preconditions left as an exercise.""" return self._items.get(index) def remove(self, index): """Preconditions left as an exercise.""" return self._items.remove(index) def insert(self, item): """Inserts item in its proper place.""" index = 0 while index < len(self) and \ item > self[index]: index += 1 self._items.insert(index, item) def index(self): """Returns the index of the given item or -1 if it is not found.""" pass #Exercise: uses a binary search
def __init__(self): self._items = ArrayIndexedList()
def __init__(self): self._items = ArrayIndexedList()