Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Cormen Appendix A
Noddy
asked
in
Algorithms
Sep 22, 2018
241
views
0
votes
0
votes
Why does (1/3+1/c) <=1?
algorithms
asymptotic-notation
time-complexity
Noddy
asked
in
Algorithms
Sep 22, 2018
by
Noddy
241
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
usdid
asked
in
Algorithms
Apr 16, 2022
269
views
a) what is the iterative equation showing the running time of the algorithm whose pseudocode is given below? b) What is this repeated equation in asymptotic notation using the Master's theorem. c) What is the same repeated equation in asymptotic notation using the recursion tree method.
usdid
asked
in
Algorithms
Apr 16, 2022
by
usdid
269
views
asymptotic-notation
time-complexity
algorithms
0
votes
0
votes
2
answers
2
GateAspirant999
asked
in
Algorithms
Feb 2, 2017
406
views
Operation on a function and its big O
GateAspirant999
asked
in
Algorithms
Feb 2, 2017
by
GateAspirant999
406
views
asymptotic-notation
algorithms
time-complexity
1
vote
1
vote
1
answer
3
Çșȇ ʛấẗẻ
asked
in
Algorithms
Aug 28, 2016
312
views
In this question the answer given is option (A) how it will come ?? Explain??
Çșȇ ʛấẗẻ
asked
in
Algorithms
Aug 28, 2016
by
Çșȇ ʛấẗẻ
312
views
algorithms
asymptotic-notation
time-complexity
test-series
3
votes
3
votes
1
answer
4
go_editor
asked
in
Algorithms
May 22, 2016
1,338
views
CMI2012-A-08
You are given two sorting algorithms A and B that work in time $O(n \log n)$ and $O(n^2)$, respectively. Consider the following statements: Algorithm $A$ will sort any array faster than algorithm $B$. On an average, algorithm $A$ will sort a given array faster ... be preferable to algorithm $B$. Which of the statements above are true? I, II and III I and III II and III None of them
go_editor
asked
in
Algorithms
May 22, 2016
by
go_editor
1.3k
views
cmi2012
algorithms
sorting
time-complexity
asymptotic-notation
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
