Abstraction in practice

• Reversing an array

  • i = 0; j = n-1;
    while (i < j) {
    swap(a[i], a[j]);
    ++i; --j;
    }

• What extraneous dependencies are there in this fragment?

Previous slide

Next slide

Back to first slide

View graphic version