What is an example algorithm with complexity O (n ^ 5)?

Question

can anyone provide an example of an algorithm with minimal runtime complexity O (n ^ 5)?

Answer 1

O n5 volume algorithm for complex bodies.

http://matmod.elte.hu/~lovasz/vol5.pdf

Answer 2

void N5(int n) { for( int n1 = 0; n1 < n; n1++ ) { for( int n2 = 0; n2 < n; n2++ ) { for( int n3 = 0; n3 < n; n3++ ) { for( int n4 = 0; n4 < n; n4++ ) { for( int n5 = 0; n5 < n; n5++ ) { DoSomething(); } } } } } } 

Answer 3

Integral Transformation: http://vergil.chemistry.gatech.edu/resources/programming/mp2-transform-project.pdf

Answer 4

 for 1 to n for 1 to n for 1 to n for 1 to n for 1 to n Do Something 

Answer 5

Finden and Gordon's Algorithm for Obtaining Common Trimmed Trees Works in O (n ^ 5)

Answer 6

It has been proven that a convex hull in 10 dimensions requires O (n ^ 5) (the proof was for general d, showing that the hull could be O (n ^ floor (d / 2)) in the worst case, IIRC)