finding the running time for my algorithm for finding whether an input is prime in terms of the input

Question

This is my function for finding prime numbers

void print(int num)
{
    for(int i=2; i<num/2; i++)
    {
        if(num%i==0)
        {
            cout<<"not prime\n";
            exit(0);
        }
    }
    cout<<"prime\n";        
}

My input in num. I'm trying to find the runtime using big oh. I remember that finding the run time had something to do with log.

The worst case would be that my program would run the n/2 -1 times?

I don't know if it matters, but this code is very inefficient. — 500 - Internal Server Error
– 500 - Internal Server Error, Commented Feb 24, 2014 at 0:51

example · Accepted Answer · 2014-02-24 01:39:04Z

3

Yes, the loop runs n/2-1 times and only contains commands of constant complexity, so your runtime scales as a*(n/2-1) for some a. In big-o this is written as O(n/2-1) and because constant factors don't matter this is equal to O(n).

(as an aside: it is actually theta(n) which means, that it is not just bounded from above by n but also from below by n)

edited Feb 24, 2014 at 1:39

answered Feb 24, 2014 at 1:04

example

3,4391 gold badge22 silver badges29 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

example Over a year ago

@TonyD too bad I mixed up little o and theta :-( it is actually theta(n) and not o(n). I will change it to O(n) because it is much better known than theta...

Collectives™ on Stack Overflow

finding the running time for my algorithm for finding whether an input is prime in terms of the input

1 Answer 1

1 Comment

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

1 Comment

Your Answer

Sign up or log in

Post as a guest

Linked

Related