an O(1) algorithm will be superior to an O(n3) algorithm in every core?

[Chaparala]

it is a question about data structures , i would like to know the answer before 3rd please help me for my external exam thanks

 

[WillH]

What do you mean by superior?

O(1) is the no-growth curve. An O(1) algorithm's performance is conceptually independent of the size of the data set on which it operates. Array element access is O(1), if you ignore implementation details like virtual memory and page faults.

O(N³) and beyond are what you would expect. Lots of inner loops.

An O(1) algorithm scales better than an O(N³) algorithm,