list

Work in Progress

Summary

List

  • class of simple linear data structures
  • sequence where order matters

Concept

List operations

  • get(i)
    • return the value at index i
  • search(v)
    • return the index of v if found within the list
    • return -1 if not found
  • insert(i,v)
    • insert v into the list at index i
  • remove(i)
    • remove the value at index i from the list