Algorithms

Front 1

Bubble Sort - Complexity

Back 1

Worst: O(n²)
Best: O(n)

Front 2

Bubble Sort implementation

Back 2

procedure bubbleSort( A : list of sortable items )
n := length(A)-1
for(i=0; i<= n; i++)
for(j=n; j>i; j--)
if A[j-1] > A[j] then
swap (A[j-1], A[j])
end if
end for
end for
end procedure

Front 3

Merge Sort - Complexity

Back 3

O(n log n)

Front 4

Merge Sort description

Back 4

split the list into two parts
merge sort left
merge sort right
merge left and right

Front 5

Quick Sort - complexity

Back 5

Avg: O(n log n)
Wst: O(n²)

Front 6

Quick Sort - overall

Back 6

if first < last
splitPoint = split array
quick sort: first -> splitPoint - 1
quick sort: splitPoint + 1 -> last

Front 7

Quick Sort - split

Back 7

sp = some split value
while first &lt;= last do
first++ until first > sp
last++ until last &lt; sp
if first &lt; last(
swap first last
first++
last++
)
end while
swap savedFirst, last

Front 8

Binary Search Tree - node

Back 8

left
right
data