553 views

1 Answer

Related questions

4 votes
4 votes
2 answers
2
worst_engineer asked Oct 7, 2015
5,912 views
In quick sort , for sorting n elements , the (n/4)th smallest element is selected as pivot using an O(n) time algorithm. What will be the time complexity?it is $\Theta (...
1 votes
1 votes
2 answers
3
6 votes
6 votes
2 answers
4
radha gogia asked Jul 15, 2015
8,998 views
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...