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

Question

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

Answer 1

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

Answer 2

O n5 volume algorithm for complex bodies.

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