Q. 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
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: (B)
bubble sort