Організація ефективного сховища даних тестування програмного забезпечення

Abstract

During software testing results of it are needed to save rationally. If tests are built as classification trees, it is got general ones. They need a lot of memory. Therefore it’s necessary to use a data structure where searching, addition/ deletion of elements are performed quickly. After analyzing common data structures as arrays, linked lists, binary and ternary trees the last ones have the best results. Despite the fact that average complexities of searching in binary and ternary trees are the same the last ones don’t need to do sorting after it. Thus they can be used for processing results of testing.