also try this question reversing th words in a string using the same reverse function written by me above
On Sun, Aug 7, 2011 at 8:39 PM, sukran dhawan <[email protected]>wrote: > very simple and common interview question > > > for(i=0;str[i];i++); // find the length of the string > > for(i=0;i<n/2;i++) > { > temp = str[i]; > str[i] = str[n-1-i]; > strpn-1-i] = temp; > } > > > it works for all cases > > On Sun, Aug 7, 2011 at 8:24 PM, Rajesh Kumar <[email protected]>wrote: > >> >> >> -- >> Regards >> Rajesh Kumar >> >> >> -- >> 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.
