×

# Asymptotic Notation

 2 Hi Everyone. i have 3 doubts. 1)Are there any O(1/n) algorithms? (Or) which is less than O(1)??? 2)In one of the MIT lecture it has been said that "Normally, even when people talk about O(g(n)) they actually mean Theta(g(n)) but technically, there is a difference." ..... but is there any specific reason for this? 3)What is the difference between size_t and int and when & where i have to use size_t instead of int? asked 13 Feb '15, 15:03 906●5●12 accept rate: 0%

 2 answered 21 Feb '15, 00:12 87●1●4●13 accept rate: 0% Interesting. Thanks for the link. (21 Feb '15, 06:40)
 0 @saiavinashiitr size_t is used when the size of the return type is not known or when you are not sure about the size of the datatype answered 13 Feb '15, 15:11 27●1●6●11 accept rate: 0% @saiavinashiitr No it is possible to exist some algorithm which has complexiy less than 0(1)!! Just checkout this link http://stackoverflow.com/questions/1592649/examples-of-algorithms-which-has-o1-on-log-n-and-olog-n-complexities (21 Feb '15, 00:00)
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×1,917
×798
×9

question asked: 13 Feb '15, 15:03

question was seen: 821 times

last updated: 21 Feb '15, 06:40