big o

traversing an array

n

search for an item array

n or logn

array remove from any location unkown

n

array get any item location unknown

1

array add item at end

1

array add item at front

n

linked list traversal

n

linked list search for item

n

linked list remove from location unknown

n

llinkedlist get item location unknown

n

linked list add item at end

n

linked list add item at frong

1

double linked list dad item at end

1

binary tree traversal

n

binary tree serach for item

logn

binary tree remove item from location unknown

logn

binary tree get item location unknown

logn

binary tree add item at end

logn

binary tree add item at front

1

arraylist traversal

n

arraylist search for item

logn or n

arraylist remove item location unknown

n

arraylist get item location unknown

1

arraylist add item at end

1

arraylist add item at front

n

tree anything

logn

hash anything

1

linear

1nn

binary

1loglog

selection

n2n2n2

bubble

n2n2n2

insertion

nn2n2

merge

nlognnlognnlogn

quick

nlognnlognn2

heap

nlognnlognnlogn