Time complexity, big o notation, Data Structure & Algorithms

The  total  of  time  needed  by  an algorithm to run to its completion is termed as time complexity. The asymptotic running time of an algorithm is given in terms of functions. The upper bound for a function 'f' is provided by the big oh notation (O). Taking 'g' to be a function from the non-negative integers to the positive real numbers, we define O(g) as a set of function f  such that  for some real constant c>0 and for some non negative integers constant n0, f(n)≤cg(n) for all n≥n0. Mathematically, O(g(n))={f(n): there are positive constants such that 0≤f f(n)≤cg(n) for all n, n≥n0} , we say "f is oh of g"

 

 

Posted Date: 7/10/2012 3:31:34 AM | Location : United States







Related Discussions:- Time complexity, big o notation, Assignment Help, Ask Question on Time complexity, big o notation, Get Answer, Expert's Help, Time complexity, big o notation Discussions

Write discussion on Time complexity, big o notation
Your posts are moderated
Related Questions
What is Space complexity of an algorithm? Explain.

The number of interchanges needed to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort is 5

explanation of doubly linklist

A binary tree is a tree data structures in which each node have at most two child nodes, generally distinguished as "right" and "left". Nodes with children are called parent nodes,

A database is a collection of data organized in a manner that facilitates updation, retrieval and management of the data. Searching an unindexed database having n keys will have a

How does cpu''s part tming and controls generate and controls signls in computer?

Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr

In this section, we will discuss about Sequential file organization. Sequential files have data records stored in a particular sequence. A sequentially organized file might be stor

A  BST is traversed in the following order recursively: Right, root, left e output sequence will be in In Descending order

To delete an element in the list at the end, we can delete it without any difficult. But, assume if we desire to delete the element at the straining or middle of the list, then, we