Register

#algo

382 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Memory ManagementNext → · Syllogism
← Previous in category · ME testNext in category → · Sorting
Position:
Show:

Related questions

0 0 votes
1 1 answer
915
915 views
Smriti012 asked Feb 3, 2017
915 views
#algorithms #best #algo
Best algorithm for this set:1.Independently sorting each of 1,000,000 arrays, each with 5 elements.2.Sorting a set of 4,000,000 numbers in worst case O(n lg n) time.
2 2 votes
1 answers 1 answer
756
756 views
Deepak Yadav asked Jan 6, 2017
756 views
#algo
Solve this problem?
1 1 vote
1 1 answer
2.5k
2.5k views
Rajesh Pradhan asked Oct 14, 2016
2,478 views
#Algo
On which of the following recurrence relation Master Theorem cannot be applied?A. T(n)=2T(n/2)+nlognB. T(n)=T(n/2)+1C. T(n)=8T(n/2)+lognD. T(n)=7T(n/4)+n2I think we can a...
3 3 votes
1 answers 1 answer
1.0k
1.0k views
papesh asked Oct 12, 2016
1,035 views
#algo
$T(N) = T(N/4) + T(N/2) + N^{2}$Find Order of given Reccurence??