Data Structures

Array / List

  • elements stored sequentially [1,200,4,99]

  • memory is allocated for every new array object, stored in continuous memory segments

  • if appending element, new array is created by copying old array and adding new size (array elements must be same data type)

  • fixed size

  • good search speed, uses index of element

  • slow insert, delete

Linked List

  • each element has 2 items, data and pointer to next node
    head > [data|next] > [data|next] > null

  • used to create hash tables,

  • fast append, remove times, slow read time, has no index to search on, requires iteration to search

  • size is dynamic

Hash Table