Register

NIELIT 2016 MAR Scientist B - Section C: 12

• retagged by
15,741 views
4 votes
4 votes

Which of the following sorting algorithms does not have a worst case running time of $O(n​^2​)$?

  1. Insertion sort.
  2. Merge sort.
  3. Quick sort.
  4. Bubble sort.
• retagged by
User Avatar

11 Answers

0 votes
0 votes
option B) Merge sort is correct , as worst case complexity of merge sort is O(nlogn).
User Avatar
0 votes
0 votes
Merge sort Shuld Be a Answer Because In Marge Sort Both Best Case ANd Worst Case Time Complexity Is O(nlogn)
Only.

Marge Sort  Time Complexity Is not Depend On the Input Which We Provide And It Will Try To  Divide a input Into Equal Part .

Please Correct Me If I am Wrong..
User Avatar
0 votes
0 votes
option B) Merge Sort is the answer , as worst case time complexity of Merge sort is O(nlogn)
User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
9
admin asked Mar 31, 2020
1,468 views
NIELIT 2016 MAR Scientist B - Section C: 22
Time complexity of an algorithm $T(n)$, where $n$ is the input size is given by $\begin{array}{ll}T(n) & =T(n-1)+\frac{1}{n}, \text{ if }n>1\\ & =1, \text{ otherwise} \end{array}$ The order of this algorithm is $\log n$ $n$ $n^2$ $n^n$
Time complexity of an algorithm $T(n)$, where $n$ is the input size is given by$\begin{array}{ll}T(n) & =T(n-1)+\frac{1}{n}, \text{ if }n>1\\ & =1, \text{ otherwise} \en...
User Avatar
0 votes
0 votes
2 answers
10
admin asked Mar 31, 2020
1,341 views
NIELIT 2016 MAR Scientist B - Section C: 17
A hash function $f$ defined as $f(\text{key})=\text{key mod }7$, with linear probing, insert the keys $37,38,72,48,98,11,56$ into a table indexed from $11$ will be stored in the location $3$ $4$ $5$ $6$
A hash function $f$ defined as $f(\text{key})=\text{key mod }7$, with linear probing, insert the keys $37,38,72,48,98,11,56$ into a table indexed from $11$ will be stored...
User Avatar
2 votes
2 votes
3 answers
11
admin asked Mar 31, 2020
1,367 views
NIELIT 2016 MAR Scientist B - Section C: 20
A hash table has space for $100$ records. Then the probability of collision before the table is $10\%$ full, is $0.45$ $0.5$ $0.3$ $0.34$ (approximately)
A hash table has space for $100$ records. Then the probability of collision before the table is $10\%$ full, is$0.45$$0.5$$0.3$$0.34$ (approximately)
User Avatar
3 votes
3 votes
2 answers
12
admin asked Mar 31, 2020
6,563 views
NIELIT 2016 MAR Scientist B - Section B: 12
If $A$ and $B$ are square matrices of size $n\times n$, then which of the following statements is not true? $\det(AB)=\det(A) \det(B)$ $\det(kA)=k^n \det(A)$ $\det(A+B)=\det(A)+\det(B)$ $\det(A^T)=1/\det(A^{-1})$
If $A$ and $B$ are square matrices of size $n\times n$, then which of the following statements is not true?$\det(AB)=\det(A) \det(B)$$\det(kA)=k^n \det(A)$$\det(A+B)=\det...
User Avatar
Link Copied!