Adaptable heuristic for source code similarity measuring.

Most of systems for plagiarism detection within a set of source codes is based on sequential comparing of each source code with all other source codes in the set. Computed similarity is in most cases so low, that we can deduce compared codes are not plagiarized. Purpose of this work is to create a heuristic algorithm for pre-selection of source code pairs for comparing. Heuristic algortihm should effectively aproximate results of the main comparing program, which is more complicated and slower. The plagiarism detection system will then decide, based on the result of heuristic algorithm, whether the source code pair will be compared using main comparing program or not. Algorithm should be self-adapting - it should be able to improve itself depending on the set of source codes saved in system