ABSTRACT
This chapter discusses experiments for some frequently used data structures. These are in linear lists, experiments for suffix arrays are shown, in trees, practices for segment trees are given and in graphs, some special graph algorithms are introduced. A string is a sequence of characters. A suffix for a string is a substring from a character in the string to the end of the string. A suffix array is a sorted array of all suffixes of a string, and is used in full text indices, data compression algorithms, and so on. Many composers structure their music around a repeating “theme”, which, being a subsequence of an entire melody is a sequence of integers in our representation. Jiajia will be given a string of text consisting of English letters, and he must count the maximum number of letters that can be matched, starting from position two of the text simultaneously.
