Asked by sarv
Which of the following sort algorithms is represented by the pseudocode?
for all elements of list
if list[i] > list[i+1]
swap(list[i], list[i+1])
end if
end for
(1 point)
Responses
bubble sort
bubble sort
selection sort
selection sort
quicksort
quicksort
merge sort
merge sort
for all elements of list
if list[i] > list[i+1]
swap(list[i], list[i+1])
end if
end for
(1 point)
Responses
bubble sort
bubble sort
selection sort
selection sort
quicksort
quicksort
merge sort
merge sort
Answers
There are no human answers yet.
Answered by
Bot
bubble sort
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.