longest repeated sequence in a long string of characters algorithm

At first step, you need to implement a brute-force approach to solve the problem, to see

how much computation is required with respect to time and available space. That algorithm

checks the length of the match at every possible pair of starting positions, so it has ~O (n2

)

character comparisons, with the constant depending on match lengths. The working brute-force

algorithm presents a basis testbed for improving.

At second phase, you are required to improve brute-force method by removing some

inefficiencies or discovering some completely different method. Even though there are

considerable amount of algorithmic solutions to this problem, your approach should yield the

fastest one. Beside these, you should use available space reasonably as well.

Your program should read the input string from your own generated file and print the

results to standard output. You need to filter out any redundancies (non-printable characters etc.)

to eliminate the noises. Then, it should output the length of the repeated substring on the first line

and substring itself on the second line.

Kemahiran: Java, Algoritma

Lihat lagi: longest common sequence visual basicnet, programming longest common sequence, longest common sequence, java program find longest common sequence, longest common sequence cgi, mb_split string characters, php cut string characters, longest common sequence coding, longest common sequence java, java code longest common sequence, php split string characters, programme longest common sequence, longest common subsequence java string, string search algorithm php, longest common sequence list java, string characters mips assembly language, longest common subsequence lcs string, split indian language string characters using php, java string difference algorithm, linux longest common sequence

ID Projek: #28679491