| TR#: | CS0867 |
| Class: | CS |
| Title: | ALGORITHM SIMPLIFICATION THROUGH
OBJECT ORIENTATION. |
| Authors: | Eliezer Kantorowitz |
| CS0867.pdf | |
| Abstract: | During an object oriented (O-O) redesign of a legacy CAD system a surprisingly simple and efficient solution algorithm was discovered for a change propagation problem. The simplification resulted in low program implementation and program extension costs. The implementation complexity was reduced from $o(N^2)$ to $o(N)$, while the extension complexity was reduced from $o(N)$ to $o(1)$. Analysis of the case shows that O-O analysis is effective at detecting such advantageous algorithms. On the other hand, it is difficult to discover such algorithms with traditional top-down analysis. This is an important reason for preferring O-O analysis. |
| Copyright | The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information |
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1995/CS/CS0867), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1995
To the main CS technical reports page