Computer Science A

UNIT $3$

LESSON $7$

Data Structures and Algorithms

Classic Algorithms

Which of the following sort algorithms is represented by the pseudocode?

for all elements of list

if $1$ ist $[i]>1$ ist $i+1$

swap$($list$[$i$],$ list$[$i$+1])$

end if

end for

$(1$ point$)$

merge sort

quicksort

selection sort

bubble sort