Aeren
Newbie level 3
Hi everyone!
I would like to make an algorithm, which compares 2 files. It takes the first file as basic, and makes the comparison to the other. The file can be modfied like this:
1. parts get removed: the prog indicates, nothing special
2. parts get included: the prog highlights these parts(different color example), no spec either
3. parts get modified: case 1 and 2 together
The program should work for unlimited depth, the program should find the matching parts correctly even after longer distance. I think after a matching sentence we can assume matching(3rd case).
Can anyone help me with this problem of mine? I want to make this in JAVA, but i really need the theory not the code itself.
Thanks!
Aeren
I would like to make an algorithm, which compares 2 files. It takes the first file as basic, and makes the comparison to the other. The file can be modfied like this:
1. parts get removed: the prog indicates, nothing special
2. parts get included: the prog highlights these parts(different color example), no spec either
3. parts get modified: case 1 and 2 together
The program should work for unlimited depth, the program should find the matching parts correctly even after longer distance. I think after a matching sentence we can assume matching(3rd case).
Can anyone help me with this problem of mine? I want to make this in JAVA, but i really need the theory not the code itself.
Thanks!
Aeren