ALGORITHM SelectionSort(A[0..n-1])
for i <- 0 to n-2 do
  min <- i
  for j <- i+1 to n-1 do
    if A[j] < A[min] min <- j
  swap A[i] and A[min]

ALGORITHM BubbleSort(A[0..n-1])
for i <- 0 to n-2 do
  for j <- 0 to n-2-i do
    if A[j+1] < A[j] swap A[j] and A[j+1]

ALGORITHM SequentialSearch2(A[0..n], K)
A[n] <- K
i <- 0
while A[i] != K do
  i <- i + 1
if i < n return i
else return -1

ALGORITHM BruteForceStringMatch(T[0..n-1], P[0..m-1])
for i <- 0 to n-m do
  j <- 0
  while j < m and P[j] == T[i+j] do
    j <- j + 1
  if j == m return i
return -1

ALGORITHM BruteForceClosestPair(P)
d <- infinity
for i <- 1 to n-1 do
  for j <- i+1 to n do
    d <- min(d, sqrt((x_i - x_j)^2 + (y_i - y_j)^2))
return d

ALGORITHM DFS(G)
count <- 0
for each vertex v in V do
  if v is marked with 0
    dfs(v)

dfs(v)
count <- count + 1; mark v with count
for each vertex w in V adjacent to v do
  if w is marked with 0
    dfs(w)

bfs(v)
count <- count + 1; mark v with count and initialize a queue with v
while the queue is not empty do
  for each vertex w in V adjacent to the front vertex do
    if w is marked with 0
      count <- count + 1; mark w with count
      add w to the queue
  remove the front vertex from the queue