Which of the following is not true about comparison based sorting algorithms?
A) the minimum possible time complexity of a comparison based sorting algorithm is o(nlogn) for a random input array
B) any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared
C) counting sort is not a comparison based sorting algortihm
D) heap sort is not a comparison based sorting algorithm.
Correct Answer:
Verified
Q15: The critical issue in parallel depth-first search
Q16: Graph search involves a closed list, where
Q17: Breadth First Search is equivalent to which
Q18: Time Complexity of Breadth First Search is?
Q19: Which of the following is not an
Q20: In BFS, how many times a node
Q21: Is Best First Search a searching algorithm
Q22: Which of the following is not a
Q24: mathematically efficiency is
A)e=s/p
B)e=p/s
C)e*s=p/2
D)e=p+e/e
Q25: Cost of a parallel system is sometimes
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