Thanks to all On Tue, Sep 13, 2011 at 4:35 PM, Kapil Gupta <[email protected]> wrote: > +1 Karthik > > On Tue, Sep 13, 2011 at 3:02 PM, kARTHIK R <[email protected]> wrote: >> >> Something like this. >> >> >> stack<char *> S; >> void function(char *s) { >> char *ptr=s; >> while(*ptr++ !=' ') {} >> *ptr = '\0'; >> S.push(s); // Will push the string till NULL into >> the stack >> function(ptr+1); >> } >> >> >> // Pop from stack to get words >> >> Karthik R >> >> >> On Tue, Sep 13, 2011 at 2:50 PM, guna sekaran <[email protected]> wrote: >>> >>> please write a code any one >>> >>> On Tue, Sep 13, 2011 at 2:06 PM, shady <[email protected]> wrote: >>> > search archives, already done >>> > >>> > On Tue, Sep 13, 2011 at 1:39 PM, Anshul Khandelwal >>> > <[email protected]> wrote: >>> >> >>> >> U can take command line argument in main >>> >> main(int argc,char * argv[ ]) >>> >> { for(i=argc-1,i>=0;i--) printf("%s ",argv[i]); >>> >> } >>> >> >>> >> >>> >> On Tue, Sep 13, 2011 at 12:05 AM, hary rathor <[email protected]> >>> >> wrote: >>> >>> >>> >>> kapil : in your solution you are required extra O(n+n*sizeOf(int *)) >>> >>> both >>> >>> memory to create a link list that really costly >>> >>> >>> >>> >>> >>> -- >>> >>> 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. >>> >> >>> >> >>> >> >>> >> -- >>> >> Regards >>> >> ANSHUL KHANDELWAL >>> >> Final year >>> >> Computer Engineering >>> >> NIT Jaipur >>> >> >>> >> >>> >> -- >>> >> 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. >>> > >>> >>> -- >>> 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. > > > > -- > Regards > KAPIL GUPTA > COMPUTER ENGINEERING > NIT JAIPUR > > -- > 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.
