menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
Update on GO Book for GATE 2022
Barc Interview Experience 2020- CSE stream
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Subjects
All categories
Testimonials
(74)
Numerical Ability
(0)
Verbal Ability
(1)
Engineering Mathematics
(15)
Algorithms
(3)
Databases
(5)
Digital Logic
(4)
CO & Architecture
(5)
Computer Networks
(4)
Compiler Design
(3)
Operating System
(7)
Programming & Data Structures
(6)
Motivation
(27)
Preparation Advice
(76)
Theory of Computation
(8)
Interview Experience
(135)
Study Materials
(50)
Useful Links
(46)
Preparation Experience
(49)
Others
(234)
Announcements
(139)
Jobs
(6)
Recent Blog Comments
Can you check again?
sir please revert back as soon as possible
sir today i have purchased gate overflow test...
This PDF contains all the Previous Year...
Mock 3 will be added soon.
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
gatebook_dsa
explain!
Prev post >> Congestion control
Next post >> New mobile app for GATE Overflow released
posted
Aug 28, 2016
in
Programming & Data Structures
Anil Khatri
948
views
0
Like
0
Love
0
Haha
0
Wow
0
Angry
0
Sad
comment
19 Comments
Show 14 previous comments
@anonymous.
Its asking for the time complexity in worst case using the best algorithm. Its not time complexity using the worst algorithm :)
For example, I can transform Dijkstras algorithm into other algo such that it takes polynimial/exponential time for running. THat doesnt mean worst case time complexity is polynomial/exponential.
Hi Sushant, i'm entirely new to gate questions. Was aware this algorithm is the worst kind. However, are we suppose to have wild assumptions ? I mean, question doesn't specify, if it meant for an algorithm of smaller input size or larger input size since there are algorithms that does well for smaller sizes.
So here which algorithm are we suppose to assume ? Some are saying it should be sorted, while others say it need not. I may be missing something.
So, i strongly believe that, questions having soo much assumptions which would vary with person to person, isn't a good fit. Am i right ?
@altaf.
Make minimum assumptions. Assumption is what you feel :). It may not be the best.
Make assumptions only to the point of deriving the answer or mandatory for deriving the answer. If assumption is giving you best answer, hold it.
You should think of the best algorithm because no one will ask you whats the worst algorithm :)
why are people posting questions as blogs ?
Hashing solves it in O(n) time ..and if hashing is not prmitted then sorting by nlogn time
ps: post queries as a question..not as a blog
Please
log in
or
register
to add a comment.
...