Home/ Questions/Q 8296373
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-08T14:58:09+00:00

I tried solving this problem in SPOJ using Booth Algorithm in O(n) time, but

  • 0

I tried solving this problem in SPOJ using Booth Algorithm in O(n) time, but it failed though it worked for all test cases I tried.
Then I did in Brute force way in O(n^2) time, it worked. I have attached the code for both the cases, tell me where I went wrong or is Booth algo a correct approach for this problem?

Isnt the problem, finding the minimum rotation for Lexicographically smallest string

For first approach, Booth Algorithm : http://ideone.com/J5gl5
For second approach, Brute Force : http://ideone.com/ofTeA

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Your algorithm gives the wrong answer for string “ABAED”, for example.

    Your algorithm returns 7 (even though this is longer than the string!).

    The correct answer is 0.

    (Note this bug may also be present in wherever you found a description of the algorithm! If you look at the history/discussion for the wikipedia article there are a lot of edits fixing bugs – both claiming to fix bugs in the original paper, and to fix bugs in bugfix…)

    It seems to work a lot better if you replace:

    if( lst[i] < lst[ans+i+1] )

    with

    if( lst[j] < lst[ans+i+1] )
    • 0