For a NxM matrix, with N lines and M columns of long integers, representing a full paragraph of text, each set of 8 letters into cell 1x1 as, L0, L1, ..., L7, are stored in the following way, l7, L6, ..., l1, l0 (i.e., backward); in the cell 1x2 presents the next set of 8 letters as follows l15, l14, ..., L9, L8, we can see the following situation: Cell [1, 1] = [L7, L6, L5, L4, L3, L2, L1, L0] Cell [1, 2] = [l15, l14, l13, l12, l11, l10, l9, l8] . . . etc.
For example, considering the text: "We are all human," we would have the following structure in the matrix considered above: Cell [1, 1] = [a, _, e, r, a, _, e, W] Cell [1, 2] = [n, a, m, u, h, _, l, l] Ask: What is the best data structure to be used for storage and retrieval of information, taking care account the lexicographe order? What is the best method of indexing the words stored in the array? -- ---------------------------------------- Luciano S. Pinheiro Jr. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
