Created by Josh Calvert
over 7 years ago


Which search/sorting algorithm is this pseudocode from and what is its function?
while left <= right and array[left] <= p
left = left + 1
Which search/sorting algorithm is this pseudocode from and what is its function?
while pos > 0 and array[position  1] > val
array[pos] = array[pos  1]
pos = pos  1
Which search/sorting algorithm is this pseudocode from and what is its function?
if array[midpoint] < item
first = midpoint + 1
else last = midpoint  1
Which search/sorting algorithm is this pseudocode from and what is its function?
if right < left flag = true
else temp = array[left]
array[left] = array[right]
array[right] = temp
Which search/sorting algorithm is this pseudocode from and what is its function?
temp = array[i]
array[i] = array[i + 1]
array[i + 1] = temp
Which search/sorting algorithm is this pseudocode from and what is its function?
while i = 0 < arraylength  1 and flag = true
flag = false
for j = 0 to arraylength  i  2
Which search/sorting algorithm is this pseudocode from and what is its function?
while i = 0 < arraylength and flag = false
if array[i] = item
flag = true
Which search/sorting algorithm is this pseudocode from and what is its function?
left = array[0, mid]
right = array[mid, arraylength  1]
run(left)
run(right)