Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: It is shown how to compute the lexicographically maximum suffix of a string of n>=2 characters over a totally ordered alphabet using at most (4/3)n-5/3 three-way character comparisons. The best previous bound, which has stood unchallenged for more than 25 years, is (3/2)n-O(1) comparisons.  also prove an interesting property of an algorithm for computing the maximum suffix both with respect to a total order  .
['Gianni Franceschini', 'Torben Hagerup']
I am writing a research paper on a idea Finding the maximum suffix with fewer comparisons
[{"from": "human", "value": "I am writing a research paper on a idea Finding the maximum suffix with fewer comparisons"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: It is shown how to compute the lexicographically maximum suffix of a string of n>=2 characters over a totally ordered alphabet using at most (4/3)n-5/3 three-way character comparisons. The best previous bound, which has stood unchallenged for more than 25 years, is (3/2)n-O(1) comparisons.  also prove an interesting property of an algorithm for computing the maximum suffix both with respect to a total order  ."}]