Other

Data Structures like arrays, stack, linked list etc is something you must have heard of but why algorithms and data structures like these are important? Well this video answers this question.This Data Structures and algorithms course is a part of my Data

0 purchase

Module
Data structures and algorithms course

Institution
Data Structures And Algorithms Course

Data Structures like arrays, stack, linked list etc is something you must have heard of but why algorithms and data structures like these are important? Well this notes answers this question. This Data Structures and algorithms course is a part of my Data Structures and Algorithms playlist

[Show more]

Preview 1 out of 2 pages

View example

Uploaded on April 9, 2023
Number of pages 2
Written in 2022/2023
Type Other
Person Unknown

£6.95

Add to cart

Add to wishlist

100% satisfaction guarantee
Immediately available after payment
Both online and in PDF
No strings attached

Time Complexity & Big O notation | Analysis and Calculation | Java C++ Anuj Bhaiya ✅DSAOne Course
#1

Time complexity is the time taken by an algorithm as a function of the length of of of input. This is time
complexity in these three lines. Time complexity means an algorithm. Just as you increase its length of
input then how does that algorithm perform ? How does that algorithms behave ? How do you use their
constraints and tell which algorithm is to be used here ? Time complexity has been invented and it
basically tells us that which is the better algorithm among the two ? And there comes in use - The Big O
Notation. This Big O notation works to quantify the time complexity of an algorithm. It tells that the this
algorithm will take this much time according to this length of input. Big O notation takes in account the
bigger power and nothing other than that. For any n which one is greater, obviously n is greater. Even if
the constant is large we 'll assume it as O ( 1 ) Even if there is a very large no. with n^2 then we 'will still
consider it O (n^2 ) If you will make the graph of n will be something like this.

Big O notation is mostly used in computer science because we remain safe by finding through Big O
notations for multiple algorithms. We constrain in THETA notation. OMEGA NOTATION tells that what
will be the lower bound of the algorithm. THETA and OMEGA notation are other notations that tell us
what is the time complexity of algorithms. Using the tree method, we 'll try to find with the. tree
method so that you can easily find the time complexity of recursive functions. First of all, you write the
non-recursive part in this way- n c. after that the. recursive part is T ( n/2 ) and the. recursion part. After
adding them then you 'll have n c operations performed. You have to see the no. of operations
performed at each step. If you want to tell which algorithm is better according to the constraint in the
online judges. Then what is the method. I have already told you about this in a previous video. But if you
still want to know then I 'll tell you. Try finding their time complexities and tell me what did you find. I'll
put their answers in my telegram channel.

You just need to check that 10^8 operations rule is being followed and you can easily find if time
constraint is given to me then what will be the algorithm. Similarly if its given between 15-18 then this
type of complexity will be accepted. If its given 100 then you can go till ( n^4 ) If 400 is given, the you can
then go till n^3. If you found that its - n log n , then the algorithms based on it , you should strike at that
time. It means I cab either apply sorting- it might be solved after sorting or such an operation that can be
don in - log n I can perform that operation n times , you can

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

You can quickly pay through credit card for the summaries. There is no membership needed.

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller rehankhan75911. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for £6.95. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

69052 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy revision notes and other study material for 15 years now

Start selling

Seller

Exam (elaborations) ·