@ambika :: assuming only pointer can move in forward direction. On Thu, Jul 28, 2011 at 11:26 PM, varun pahwa <[email protected]>wrote:
> @amit:: I think ur solution will give wrong answer if all the characters > are not unique. > > On Thu, Jul 28, 2011 at 11:13 PM, SAMMM <[email protected]> wrote: > >> >> http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm >> >> >> >> >> U can try this too .. Without any recursion ... >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > Varun Pahwa > B.Tech (IT) > 7th Sem. > Indian Institute of Information Technology Allahabad. > Ph : 09793899112 > Official Email :: [email protected] > Another Email :: [email protected] > > People who fail to plan are those who plan to fail. > > -- Varun Pahwa B.Tech (IT) 7th Sem. Indian Institute of Information Technology Allahabad. Ph : 09793899112 Official Email :: [email protected] Another Email :: [email protected] People who fail to plan are those who plan to fail. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
