Register
Dark Mode

made_easy

in Algorithms
208 views
1 vote
1 vote

in Algorithms
by
208 views

1 comment

by
A. O(2n+1/n) = O(1/n)
B. theta(n log logn) ( master theorem case 2.b)
D. theta(n^2 logn) (master theorem case 2.a)
0
0

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
hs_yadav asked in Algorithms Dec 15, 2017
358 views
Made_easy test
hs_yadav asked in Algorithms Dec 15, 2017
by hs_yadav
358 views
0 votes
0 votes
0 answers
3
garimanand asked in Digital Logic Jan 8, 2019
131 views
Made_Easy
garimanand asked in Digital Logic Jan 8, 2019
by garimanand
131 views
0 votes
0 votes
1 answer
4
garimanand asked in Digital Logic Jan 8, 2019
264 views
Made_easy
garimanand asked in Digital Logic Jan 8, 2019
by garimanand
264 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!