list
Summary
List
- class of simple linear data structures
- sequence where order matters
Concept
List operations
get(i)- return the value at index
i
- return the value at index
search(v)- return the index of
vif found within the list - return -1 if not found
- return the index of
insert(i,v)- insert
vinto the list at indexi
- insert
remove(i)- remove the value at index
ifrom the list
- remove the value at index