Register

GATE CSE 1994 | Question: 1.19, ISRO2016-31

• retagged by
18,460 views

7 Answers

0 votes
0 votes
quick sort algo:

T(n)=T(n-k)+T(k-1)+n

this is an unstable but efficient algorithm to sort large input array and it have only two phase divide and conquer phase ,combine phase is not present here,,,so C option is correct Divide and Conquer technique
User Avatar
0 votes
0 votes

ANSWER – C

Quicksort is a DIVIDE AND CONQUER TECHNIQUE. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.

User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

30 votes
30 votes
7 answers
1
Kathleen asked Oct 4, 2014
18,118 views
GATE CSE 1994 | Question: 1.7, ISRO2017-14
The recurrence relation that arises in relation with the complexity of binary search is: $T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+\log n$ $T(n) = T\left(\frac{n}{2}\right)+n$
The recurrence relation that arises in relation with the complexity of binary search is:$T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$$T(n) = T\left(\fra...
User Avatar
56 votes
56 votes
8 answers
2
Kathleen asked Oct 9, 2014
31,686 views
GATE CSE 1996 | Question: 2.13, ISRO2016-28
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above
The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above
User Avatar
26 votes
26 votes
7 answers
3
khushtak asked Feb 14, 2017
7,042 views
GATE CSE 2017 Set 1 | Question: 05
Consider the following table: ... $(P) \leftrightarrow (i), (Q) \leftrightarrow (ii), (R) \leftrightarrow (iii)$
Consider the following table:$$\begin{array}{|l|}\hline \textbf {Algorithms} & \textbf{Design Paradigms } & \\\hline \text{P. Kruskal} & \text{i. Divide and Conquer} \...
User Avatar
21 votes
21 votes
2 answers
4
Kathleen asked Oct 8, 2014
5,024 views
GATE CSE 1995 | Question: 1.5
Merge sort uses: Divide and conquer strategy Backtracking approach Heuristic search Greedy approach
Merge sort uses:Divide and conquer strategyBacktracking approachHeuristic searchGreedy approach
User Avatar
Link Copied!