top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

What is the relation of complexity with the speed of the execution?

+2 votes
403 views
What is the relation of complexity with the speed of the execution?
posted Oct 13, 2014 by anonymous

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button

1 Answer

+1 vote

The execution speed of a program depends on the complexity of the algorithm, which is executed. If this complexity is low, the program will execute fast even for a big number of elements. If the complexity is high, the program will execute slowly or will not even work (it will hang) for a big number of elements.

answer Oct 13, 2014 by Pushkar K Mishra
Similar Questions
+1 vote
Java: Need a fully functional hash table with time complexity for search O(n)

I need a fully functional hash table with time complexity for search O(n). Can someone please help me?

+1 vote
How can I calculate the complexity of a system call?

I am using for loop. In for loop there is one system call OR POSIX API (EX : read , write, fopen, fclose, open, close , pthread_create etc...)
How can I calculate the complexity of program. Is there any link where I can see code of system call or complexity ??

...