Toggle navigation
About
Contact US
Jobs
Coding
Interview Questions
Submit
CseWay
A Way For Learning
Big-Oh and Big-Omega Notation
datastructures&algorithms
No comments
Big-Oh and Big-Omega Notation
When we say T(n) is O(f(n)), we know that f(n) is an upper bound on the growth rate of
T(n). To specify a lower bound on the growth rate of T(n) we can use the notation T(n) is
W(g(n)).
Newer Post
Older Post
No comments :
Post a Comment
Subscribe to:
Post Comments ( Atom )
Popular Posts
Advantages and Disadvantages of stacks and Queues
Stack/Queue are ideal for enforcing sequential rules of access (LIFO & FIFO as you stated) while Array is ideal for allowing random acc...
Why would you choose a database system instead of simply storing the data in Operating system files?
A database is an integrated collection of data, usually so large that it has to be stored on secondary
DIFFERENCE BETWEEN PHYSICAL AND LOGICAL DATA INDEPENDENCE
DIFFERENCE BETWEEN PHYSICAL AND LOGICAL DATA INDEPENDENCE
What is the difference between avl tree and binary search tree?
A binary tree is a tree data structure in which each node has at most two children. Typically the child nodes are called left and right. On...
Advantages and Disadvantages of Quicksort over Merge sort
Theoretically, both quick sort and merger sort take O(nlogn) time and hence time taken to sort the elements remains same.
Translate
Contact Form
Name
Email
*
Message
*
No comments :
Post a Comment