@kavitha: u can use back tracking to print all the substring for a
string .. pseudo code should look some thing like this:
void next_perm(string st,int pos)
{
if(pos==length)
{
cout<<st;
return;
}
for(int i=pos;i<length;i++)
{
swap(st,i,pos);
next_perm(st,i+1);
swap(st,i,pos);
}
}
On 7/26/11, ankit sambyal <[email protected]> wrote:
> @Swetha :Number of possible sub strings of a string of length n is of
> the order of n^2.
> So, there can,t be a better solution than O(n^2)
>
> --
> 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.
>
>
--
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.
