string str = "i am a programmer"
for(int i = 0; i < str.size()/2; i ++)
swap(str[i], str[str.size()-i-1]);
time complexity O(n)
On Mon, Aug 15, 2011 at 6:39 PM, sukran dhawan <[email protected]>wrote:
> reverse(string,n) // do it in place
>
>
> p = str;
> for(i=0;i<length(str);i++)
> {
> if(str[i] == '\0' || str[i] == ' ')
> {
> reverse(p,len);
> p = p+len+1;
> len = 0;
> }
> else
> len++;
> }
>
> On Mon, Aug 15, 2011 at 4:48 PM, programming love <
> [email protected]> wrote:
>
>> write a program to reverse the words in a give string.
>> also state the time complexity of the algo.
>>
>> if the string is "i am a programmer"
>> the output should be "programmer a am i"
>>
>> --
>> 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.
>
--
MeHdi KaZemI
--
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.
