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
Time Complexity
HeadShot
asked
in
Algorithms
Aug 9, 2018
304
views
0
votes
0
votes
HeadShot
asked
in
Algorithms
Aug 9, 2018
by
HeadShot
304
views
answer
comment
Follow
share this
share
4 Comments
Show 2 previous comments
by
Devshree Dubey
commented
Aug 9, 2018
reply
Follow
share this
@MiNipanda,Could you please work out your steps?
0
0
by
MiNiPanda
commented
Aug 9, 2018
reply
Follow
share this
https://gateoverflow.in/231844/time-complexity#c232038
See my first comment..here only the difference is in the k loop..there it was logn here it will be logn(logn) because for each iteration logn time required to compute n/2 which earlier was taking constant time.
Also if you find something wrong there so point it out..
2
2
by
Devshree Dubey
commented
Aug 9, 2018
reply
Follow
share this
@MiniPanda,Thanks. :)
0
0
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
Taaps8116
asked
in
Algorithms
Jan 13
106
views
What will be the time complexity of recurrence relation T(n)? T(n) = T(n-1) + T(n-2) + n if n >2 , Otherwise -3
Taaps8116
asked
in
Algorithms
Jan 13
by
Taaps8116
106
views
1
vote
1
vote
1
answer
2
Sajal Mallick
asked
in
Algorithms
Nov 28, 2023
471
views
algorithm time complexity madeeasy
Consider the problem that given a set Sof n integers and another integer x, whether or not there exist two elements in S whose sum is exactly x. What is the worst case time complexity for the most efficient algorithm which solves the given problem? Is not it work like subset sum problem in dynamic programming? Then complexity should be O(n^2). How O(n logn)?
Sajal Mallick
asked
in
Algorithms
Nov 28, 2023
by
Sajal Mallick
471
views
algorithms
time-complexity
made-easy-test-series
made-easy-booklet
0
votes
0
votes
0
answers
3
Sajal Mallick
asked
in
Algorithms
Nov 28, 2023
180
views
algorithm time complexity madeeasy ots
What will be the complexity?
Sajal Mallick
asked
in
Algorithms
Nov 28, 2023
by
Sajal Mallick
180
views
algorithms
time-complexity
made-easy-test-series
made-easy-booklet
job
scheduling
0
votes
0
votes
1
answer
4
NeelParekh
asked
in
Algorithms
Jul 27, 2023
282
views
Algorithm Array Time complexity on splitting
If an array is split in the form of increasing and decreasing order then what is TC to find minimum element in the array?
NeelParekh
asked
in
Algorithms
Jul 27, 2023
by
NeelParekh
282
views
algorithms
time-complexity
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