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
A) selection sort
B) bubble sort
C) parallel selcetion sort
D) parallel bubble sort
Correct Answer:
Verified
Q11: Which of the following is TRUE for
Q12: Which of the following is NOT a
Q13: The procedure of sorting a bitonic sequence
Q14: While mapping Bitonic sort on Hypercube, Compare-exchange
Q15: Which of following is NOT A WAY
Q17: The odd-even transposition algorithm sorts n elements
Q18: What is TRUE about SHELL SORT
A)moves elements
Q19: Which is the fastest sorting algorithm
A)bubble sort
B)odd-even
Q20: Quicksort's performance is greatly affected by the
Q21: Pivot in Quick sort can be selected
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents