An algorithm Problem
Posted
by Vignesh
on Stack Overflow
See other posts from Stack Overflow
or by Vignesh
Published on 2010-03-12T09:48:26Z
Indexed on
2010/03/12
13:27 UTC
Read the original article
Hit count: 312
code-coverage
|algorithm
For coverage, I've a set of run time variables of from my program execution. It happens that I get it from a series of executions(Automated testing). ie. its a vector<vector<var,value>>
I've a limited set of variables with expected values and generate combination s, that is I have vector<vector<var,value>(smaller than the execution vector)>
. Now I need to compare and tell which of the combination I generated were exactly executed in one of the tests.
My algo is O(n^4). Is there any way to bring it down. Something like set intersection. I'm using java, and vectors because of thread safety.
© Stack Overflow or respective owner