Multiple Choice
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
Correct Answer:
Verified
Q11: The VLIW architecture follows ..... approach to
Q12: Quicksort's performance is greatly affected by the
Q13: Which of the following is NOT a
Q14: What is the worst case time complexity
Q15: _ have been developed specifically for pipelined
Q17: The parallel execution of operations in VLIW
Q18: In sorting networks for DECREASING COMPARATOR with
Q19: In sorting networks for INCREASING COMPARATOR with
Q20: Which is the fastest sorting algorithm<br>A)bubble sort<br>B)odd-even
Q21: Which of the following is a combination