Register

Recent questions tagged sorting

1 votes
1 answer
511
What is the proper order in which we can arrange the sorting algos in terms of the number of swap operations they do ?
I am not getting which algorithm has minimum no of swap operations , acc to me both selection and insertion should be at the lowest level as well as merge sort since afte...
User Avatar
6 votes
2 answers
512
Assume that a CPU can process $10^8$ operations per second. Suppose you have to sort an array with $10^6$ elements. Which of the following is true?
Assume that a CPU can process $10^8$ operations per second. Suppose you have to sort an array with $10^6$ elements. Which of the following is true? 1. Insertion sort will...
User Avatar
0 votes
1 answer
513
DATA STRUCTURES
Suppose we are comparing implementations of insetion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort runs in 64nlgn steps. For which values of n does insertion sort beat merge sort?
Suppose we are comparing implementations of insetion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort ru...
User Avatar
0 votes
2 answers
515
Time complexity
Consider a sorted array of 'n' elements an element in the array is said to be majority element if it is occuring more than n/2 times of the array, the time complexity of algorithm which is most efficient to determine if the array contains majority element or not is O(... )?
Consider a sorted array of 'n' elements an element in the array is said to be majority element if it is occuring more than n/2 times of the array, the time complexity of ...
User Avatar
0 votes
1 answer
516
minimum number of comparison required to compute the largest and second largest element in an array is
a) n- ( lg(n)) - 2b) n + (lg(n)-2)
User Avatar
59 votes
5 answers
517
GATE CSE 2015 Set 3 | Question: 27
Assume that a mergesort algorithm in the worst case takes $30$ seconds for an input of size $64$. Which of the following most closely approximates the maximum input size of a problem that can be solved in $6$ minutes? $256$ $512$ $1024$ $2018$
Assume that a mergesort algorithm in the worst case takes $30$ seconds for an input of size $64$. Which of the following most closely approximates the maximum input size ...
User Avatar
0 votes
1 answer
522
sorting
User Avatar
0 votes
1 answer
523
Explain
User Avatar
66 votes
7 answers
525
GATE IT 2008 | Question: 43
If we use Radix Sort to sort $n$ integers in the range $\left (n^{k/2}, n^k \right ]$, for some $k > 0$ which is independent of $n$, the time taken would be? $\Theta(n)$ $\Theta(kn)$ $\Theta(n \log n)$ $\Theta(n^2)$
If we use Radix Sort to sort $n$ integers in the range $\left (n^{k/2}, n^k \right ]$, for some $k 0$ which is independent of $n$, the time taken would be?$\Theta(n)$$\T...
User Avatar
18 votes
2 answers
528
GATE CSE 1995 | Question: 12
Consider the following sequence of numbers:$92, 37, 52, 12, 11, 25$ Use Bubble sort to arrange the sequence in ascending order. Give the sequence at the end of each of the first five passes.
Consider the following sequence of numbers:$$92, 37, 52, 12, 11, 25$$ Use Bubble sort to arrange the sequence in ascending order. Give the sequence at the end of each of ...
User Avatar
35 votes
6 answers
529
GATE CSE 1995 | Question: 1.16
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of $O(m)$ $O(n)$ $O(m+n)$ $O(\log m + \log n)$
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of$O(m)$$O(n)$$O(m+n)$$O(\log m + \log n)$
User Avatar
21 votes
2 answers
530
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
61 votes
10 answers
531
GATE CSE 2014 Set 3 | Question: 14
You have an array of $n$ elements. Suppose you implement quicksort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the worst case performance is $O(n^2)$ $O(n \log n)$ $\Theta(n\log n)$ $O(n^3)$
You have an array of $n$ elements. Suppose you implement quicksort by always choosing the central element of the array as the pivot. Then the tightest upper bound for the...
User Avatar
44 votes
4 answers
533
GATE CSE 2006 | Question: 52
The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot? $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$ $\Theta (n^{3})$
The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot?$\T...
User Avatar
72 votes
14 answers
535
GATE CSE 2012 | Question: 39
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is $O (n \log n) $ $ O(n^{2} \log n) $ $ O(n^{2} + \log n) $ $ O(n^{2}) $
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is$O (n \log...
User Avatar
26 votes
3 answers
536
GATE CSE 1998 | Question: 1.22
Give the correct matching for the following pairs: ... $\text{A-R B-P C-S D-Q}$ $\text{A-P B-R C-S D-Q}$ $\text{A-P B-S C-R D-Q}$
Give the correct matching for the following pairs: $$\begin{array}{ll|ll}\hline \text{(A)} & \text{$O (\log n)$} & \text{(P)} & \text{Selection} \\\hline \text{(B)} & \t...
User Avatar
6 votes
3 answers
537
Sorting under restriction
Array of n elements with first 10 and last 50 elements unsorted..find an algo which runs faster a)merge sort b)quick sort c)insertion sort d)bubble sort Explain
Array of n elements with first 10 and last 50 elements unsorted..find an algo which runs faster a)merge sort b)quick sort c)insertion sort d)bubble sort Explain
User Avatar
113 votes
9 answers
538
GATE CSE 2013 | Question: 30
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is$\Theta(1)$$\Theta(\sqrt{\log} n)$$\Theta(\frac{\log n}{\log \log n})$$\Theta(\log n)...
User Avatar
31 votes
3 answers
539
GATE CSE 1999 | Question: 8
Let $A$ be an $n \times n$ matrix such that the elements in each row and each column are arranged in ascending order. Draw a decision tree, which finds $1$st, $2$nd and $3$rd smallest elements in minimum number of comparisons.
Let $A$ be an $n \times n$ matrix such that the elements in each row and each column are arranged in ascending order. Draw a decision tree, which finds $1$st, $2$nd and $...
User Avatar
26 votes
2 answers
540
GATE CSE 1999 | Question: 1.12
A sorting technique is called stable if it takes $O (n \log n)$ time it maintains the relative order of occurrence of non-distinct elements it uses divide and conquer paradigm it takes $O(n)$ space
A sorting technique is called stable ifit takes $O (n \log n)$ timeit maintains the relative order of occurrence of non-distinct elementsit uses divide and conquer paradi...
User Avatar
Page: