What Does This Do?

Assume a and b positive integers.

int Naive(int a, int b)
// Naive algorithm
{
   int x = a, y = b, z = 0;
   while (x > 0)
   {
      z += y;
      x--;
   }
   return z;           
}

Animated example.


next up previous
Next: Algorithm Development Up: ALGORITHM CASE STUDY Previous: ALGORITHM CASE STUDY