Index

A

algorithm describing amortized constant-time analysis apriori experimental

apriori analysis array fixed-size resizable

B

big-O notation big-omega notation big-theta notation

binary search pseudocode running time Scala implementation

C

counting sort

D

deque

double-ended queue doubly-linked list

E

experimental analysis matrix multiplication mergesort quicksort

I

immutable linked list

insertion sort stability

L

linear search pseudocode running time linked list doubly-linked immutable mutable

little-o notation little-omega notation load factor resizable array Lomuto's partitioning algorithm

M

matrix multiplication experimental analysis running time merge operation mergesort experimental analysis main routine memory requirement merge running time small sub-arrays

mutable linked list

N

notation big-O big-omega big-theta little-o little-omega

P

pivot element quicksort

pseudocode binary search linear search

Q

queue quicksort analysis equal elements experimental analysis partitioning algorithm pivot element pivot element selection stability

R

radix sort recurrence binary search subset sum algorithm recursive program running time resizable array capacity expansion factor load factor size reverse Polish notation

running time average-case best-case binary search linear search matrix multiplication measuring in Scala mergesort of algorithms recursive program subset sum algorithm worst-case

S

selection sort stability small sub-arrays mergesort sorting algorithm counting sort insertion sort lower bounds in running time mergesort radix sort selection sort

sorting algoritm in place memory requirement stable stability insertion sort quicksort selection sort stack subset sum algorithm running time