Click here to Skip to main content
15,896,456 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
Hey guys

I've been on this for while but i couldn't find any useful thing.

I want to write a function which takes O(N^4) time.

I wonder to know if there is some algorithm which has O(N^4) execution time?

It should be useful algorithm, not simply 4 for-loop which does a funny things!!!

Any suggestion will help.

Thanks in advance.
Posted
Updated 1-Apr-11 19:31pm
v2

1 solution

Why?
Normally, you try to work out the Omicron for an algorithm, rather than the other way around...

Still, the only one I could find was here: An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs[^] I have no idea how the heck you would test it though...
 
Share this answer
 
Comments
dariush_ha 2-Apr-11 14:29pm    
it helped, tnx
dariush_ha 2-Apr-11 14:34pm    
that link is not free, free pdf of this article download
link

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



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900