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

Related MCQs

• to solve the all-pairs shortest paths problem which algorithm's is/are used a) Floyd's algorithm b) Dijkstra's single-source shortest paths c) Prim's Algorithm d) Kruskal's Algorithm
• The procedure of sorting a bitonic sequence using bitonic splits is called
• Which of the following is not a stable sorting algorithm in its typical implementation.
• Which is the fastest sorting algorithm
• The algorithm terminates in _____ steps
• All-to-All Broadcast and Reduction algorithm on a Ring terminates in                   steps.
• Which of the following is not true about comparison based sorting algorithms?
• Which of the following is not an application of topological sorting?
• Which of the following statements is NOT TRUE for Internal Sorting algorithms
• Which of following is NOT A WAY of mapping the input wires of the bitonic sorting network to a MESH of processes