Register

What is the complexity of a generate-and test algorithm?

765 views
2 votes
2 votes

In the absence of a comparator, the time complexity of a generate-and test type of algorithm to sort n numbers would be of the order : 

(A) log n

(B) n2

(C) n

(D) n!
 

User Avatar

Please log in or register to answer this question.

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

Related questions

20.9k
views
2 answers
8 votes
radha gogia asked Jul 19, 2015
20,906 views
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array where k is a positive integer smaller than size of array. Which sorting algorithm can be easily modified for sorting this array and what is the obtainable time complexity?
(A) Insertion Sort with time complexity O(kn)(B) Heap Sort with time complexity O(nLogk)(C) Quick Sort with time complexity O(kLogk)(D) Merge Sort with time complexity O(kLogk) what is the approach of doing this question ?
User Avatar
1.3k
views
2 answers
1 votes
radha gogia asked Jul 22, 2018
1,286 views
What is the time complexity of Make-set function in kruskal algorithm ?
what is the time-complexity in kruskal algorithm for the overall step 2 where for each vertex Make-set function is called ? How come overall time for this step is ... of loop we have v sets of 1 vertex each .Please explain this clearly .
User Avatar
3.4k
views
2 answers
0 votes
nehab.sairam asked Jul 18, 2015
3,426 views
Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than 1000 in s.What will be the time complexity???????
User Avatar
Link Copied!