Which of following data structure is more appropriate for implementing quick sort iteratively?

M

Mr. Dubey • 52.77K Points
Coach

Q. Which of following data structure is more appropriate for implementing quick sort iteratively?

(A) Deque

(B) Queue

(C) Stack

(D) Priority queue

Correct Answer - Option(C)
Views: 345
Filed under category Data Structure (DS)

Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. How many times will process P0 print '0'?

Q. We usually use feature normalization before using the Gaussian kernel in SVM. What is true about feature normalization? 1. We do feature normalization

Q. Which of the following pattern is the basis of interaction management in many web- based systems?

Q. The important aspect of the data warehouse environment is that data found within the data warehouse is__________.

Q. Speedup obtained when the problem size is _______ linearly with the number of processing elements.

Q. Which of the following is not a business goal of re-engineering?

Q. This is a time-sensitive service:

Q. Who suggested Stored Program Concept

Q. Which of the following is a characteristic of an Agile leader?

Q. Which are the two types of device files?

Question analytics