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

can anyone provide an example of an algorithm with minimal running time complexity of O(n^5)?开发者_StackOverflow中文版

---

O n5 volume algorithm for complex bodies.

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

---

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

---

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();
                    }
                }
            }
        }
    }
}

---

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

---

Finden and Gordon's algorithm on Obtaining common pruned trees runs in O(n^5)

---

Convex hull in 10 dimensions has been proven to require O(n^5) (the proof was for general d, showing that the hull can be O(n^floor(d/2)) in the worst case, IIRC)