You are not logged in. Please login at to post your questions!


Asymptotic Notation

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

saiavinashiitr's gravatar image

accept rate: 0%

edited 21 Feb '15, 00:21


answered 21 Feb '15, 00:12

chaman_amit's gravatar image

accept rate: 0%

Interesting. Thanks for the link.

(21 Feb '15, 06:40) tijoforyou2★

@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

yogeshforyou's gravatar image

accept rate: 0%

@saiavinashiitr No it is possible to exist some algorithm which has complexiy less than 0(1)!! Just checkout this link

(21 Feb '15, 00:00) chaman_amit1★
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • 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:


question asked: 13 Feb '15, 15:03

question was seen: 813 times

last updated: 21 Feb '15, 06:40