Draw the call graphs for a non-trivial program you have written, and determine its tree impurity. Does

Question:

Draw the call graphs for a non-trivial program you have written, and determine its tree impurity. Does the number obtained agree with our intuitive idea about the ‘quality’ of the decomposition?

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: