Breaking News: Grepper is joining You.com. Read the official announcement!

o(n)

PrashantUnity answered on May 5, 2021 Popularity 10/10 Helpfulness 2/10

answer o(n)

related O(n!)

o(n)

Comment

  n				Worst Case			   Comment
<=[10..11]		O(n!),O(n^6) 		   Enumerating Permutations
<=[15..18]		O(2^n X n^2) 		   DP Travel and Salesman Problem
<=[18..22]		O(2^n X n)			   DP With Bitmask Technique
<=100			O(n^4) 				   DP With 3 dimention + O(n)loop
<=400			O(n^3)				   Floyd Warshall's
<=2000			O(n^2Log(n))		   2-Nested Loop +tree-related DS
<=10,000		O(n^2)				   Bubble/Selection/Insertion Sort
<=1M			O(nLog(n))			   Merge Sort , Building Segment Tree
<=100M			O(n),O(Log(n)),O(1)    Bottleneck 

Source - From Competitive Programming 3 Book

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: big-o dynamic-programming notation structure time-complexity whatever

Link to this answer
Share Copy Link

Contributed on Dec 29 2022

PrashantUnity

0 Answers Avg Quality 2/10

Closely Related Answers

O(n!)

Comment

void nFacRuntimeFunc(int n) {
  for(int i=0; i<n; i++) {
    nFacRuntimeFunc(n-1);
  }
}

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: stackoverflow.com

Tags: whatever whateve

Link to this answer
Share Copy Link

Contributed on May 05 2021

Gorgeous Grebe

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

o(n)

Contents

More Related Answers

o(n)

Closely Related Answers

O(n!)

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.