What is best, average and worst time complexity for prime function?

Question

1.00/5 (1 vote)

See more:

Hello, what is time complexity for the prime number function , i took function as
IsPrime(int n)?

What I have tried:

i have designed an algorithm with three important cases.
let "i" be the integer
1.i<2 it returns false.
2.i==2 it returns true.
3.i%2==0 it returns false.
is this the way to know the complexity of prime number??

Posted 21-Sep-16 8:30am

Mustafa_ub2016

Updated 21-Sep-16 9:10am

David_Wimbley

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Patrice T · Answer 1 · 2016-09-21T09:10:00

Solution 1

Your algorithm have nothing to do with prime integers.
your algorithm is missing in the result when i%2 != 0.

Since your algorithm have nothing to do with prime integers, there is no complexity answer.

Posted 21-Sep-16 9:10am

Patrice T