Multiple Choice
Shell sort is an improvement on
A) quick sort
B) bubble sort
C) insertion sort
D) selection sort
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q3: Time Complexity of DFS is? (V -
Q4: In parallel Quick Sort each process divides
Q5: Which formulation of Dijkstra's algorithm exploits more
Q6: Best-first search (BFS) algorithms can search both
Q7: to solve the all-pairs shortest paths problem
Q9: In execution of the hypercube formulation of
Q10: A CUDA program is comprised of two
Q11: A complete graph is a graph in
Q12: Simple backtracking is a depth-first search method
Q13: What is the average case time complexity