1

Which is the sorting algorithm in below given steps - 1. procedure X_SORT(n) 2. begin 3. for i := n - 1 downto 1 do 4. for j := 1 to i do 5. compare-exchange(aj, aj + 1); 6. end X_SORT

Correct Answer: bubble sort

Make the most of this question

This page focuses on one High Performance Computing question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.