Register

UGC NET CSE | November 2017 | Part 2 | Question: 24

• edited by
810 views
0 votes
0 votes

A list of n strings, each of length n, is sorted into lexicographic order using merge - sort algorithm. The worst case running time of this computation is:

  1. $O (n \log n)$
  2. $O (n^{2} \log n)$
  3. $O (n^{2}+\log n)$
  4. $O(n^{3})$
• edited by
User Avatar

Please log in or register to answer this question.

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

Related questions

1 votes
1 votes
2 answers
1
Arjun asked Nov 5, 2017
3,113 views
UGC NET CSE | November 2017 | Part 2 | Question: 50
Which speed up could be achieved according to Amdahl's Law for infinte number of processes if $5\%$ of a program is sequential and the remaining part is ideally parallel? Infinite $5$ $20$ $50$
Which speed up could be achieved according to Amdahl's Law for infinte number of processes if $5\%$ of a program is sequential and the remaining part is ideally parallel?...
User Avatar
0 votes
0 votes
1 answer
2
Arjun asked Nov 5, 2017
2,551 views
UGC NET CSE | November 2017 | Part 2 | Question: 49
Which of the given wireless technologies used in IoT, consumes the least amount of power? Zigbee Bluetooth Wi-Fi GSM/CDMA
Which of the given wireless technologies used in IoT, consumes the least amount of power?ZigbeeBluetoothWi-FiGSM/CDMA
User Avatar
0 votes
0 votes
2 answers
3
Arjun asked Nov 5, 2017
4,626 views
UGC NET CSE | November 2017 | Part 2 | Question: 48
Which of the following is not a Clustering method? K-Means method Self Organizing feature map method K- nearest neighbor method Agglomerative method
Which of the following is not a Clustering method?K-Means methodSelf Organizing feature map methodK- nearest neighbor methodAgglomerative method
User Avatar
Link Copied!