A Duplicate Code Checking Algorithm for the Programming Experiment

Recent years have witnessed a growing-number of plagiarism in the IT circle with the fast-developing Internet technology and an industry of software piracy is also simmering beneath the surface. There is no doubt that the plagiarists´ behaviors belong to intellectual property infringement. So bad is the consequence that the plagiarism identification is drawing more and more attention from the public nowadays. Based on the longest common subsequence seeking algorithm, this paper develops a dynamic programming to solve the duplicate code checking problem and puts forward a new method to measure the program code similarity. Compared with other state-of-the-art LCS solutions, the proposed algorithm has higher efficiency and lower time complexity in most experimental cases.