What is Big O in datastructures and algorithms

We are building EduLadder(ELADR) - Protocol

The Eladr Protocol is a decentralized, security and efficiency enhanced Web3 noSQL database powered by IPFS as the data storage layer https://ipfs.io/, and the Cardano block chain as the rewards token platform, https://cardano.org/. It provides a JSON based, IPFS layer 2 solution for data indexing and retrieval in an 'append only' file system built with open source Node.js API libraries.

The ELADR token was designed to incentivize and reward community members as a proof of contribution. Token holders are also granted access to EduLadder.com premium features as well as associated ELADR token enabled apps.

WHITE PAPER Buy Now Try BETA

Real Problems! Real Experts!

Join Our Telegram Channel !

The Eduladder is a community of students, teachers, and programmers. We help you to solve your academic and programming questions fast.
In eduladder you can Ask,Answer,Listen,Earn and Download Questions and Question papers.
Watch related videos of your favorite subject.
Connect with students from different parts of the world.
Apply or Post Jobs, Courses ,Internships and Volunteering opportunity. For FREE
See Our team
Wondering how we keep quality?
Got unsolved questions? Ask Questions

GATE GMAT CBSE NCERT Career Interview Railway UPSC NID NIFT-UG NIFT-PG PHP AJAX JavaScript Node Js Shell Script Research

DataStructures-Using-C---06CSL37-VTU-notes-->View question

What is Big O in datastructures and algorithms?

I want to know about the importance of Big O in writing algorithms. And what is meant by checking the efficiency of a program by using Big O.

Asked On2019-05-20 15:18:10 by:Vinayaelma

Taged users:
PerumalS electron ayushi9799 batsam22 prajwalamv tarun101 13priya Rajiv milan-ransingh naikaumprakash Fututron satyashiromani Amogh Rohit498 Aparna-Dasgupta edu-Freak pallaviaithaln arunwebber neenu2 bino

Likes:
VarghesePonnuAmmuRajaniRuthMahimachachuLakshmipraseedGraceSusanAkshayJJithukAjithThomasRiyamCatherinAjayjohn

Dislikes:
Be first to dislike this question
Talk about this Like Dislike

View all questions

Answers

The Big O notation defines an upper bound of an algorithm, it bounds a function only from above. For example, consider the case of Insertion Sort. It takes linear time in best case and quadratic time in worst case. We can safely say that the time complexity of Insertion sort is O(n^2). Note that O(n^2) also covers linear time.

The Big-O Asymptotic Notation gives us the Upper Bound Idea, mathematically described below:

f(n) = O(g(n)) if there exists a positive integer n₀ and a positive constant c, such that f(n)≤c.g(n) ∀ n≥n₀

Answerd on:2019-05-24 Answerd By:RSHAH12

Likes:
|RSHAH12

Dislikes:
Be first to dislike this answer
Talk about this Like Dislike

Lets together make the web is a better place

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.
Answer a question: You can answer the questions not yet answered in eduladder.How to answer a question
Career: Work or do your internship with us.Work with us
Create a video: You can teach anything and everything each video should be less than five minutes should cover the idea less than five min.How to upload a video on eduladder

Welcome to Eduladder V 4.0

Ads

What is Big O in datastructures and algorithms?

I want to know about the importance of Big O in writing algorithms. And what is meant by checking the efficiency of a program by using Big O.

Similar Questions

Notes