How about using goto label?? and at label using a switch case with respect
to turn around with values??
On Wed, Jun 13, 2012 at 11:56 AM, Amitesh Singh singh.amit...@gmail.comwrote:
signals and logjmp/setjmp()
--
Amitesh
On Wed, Jun 13, 2012 at 10:40 AM, saurabh singh
names[3] = names[4]; //Cant be done like these as they are char arrays
On Mon, Jun 4, 2012 at 4:12 AM, mahendra sengar sengar.m...@gmail.comwrote:
main()
{
static char names[5][20]={pascal,ada,cobol,fortran,perl};
int i;
char *t;
t=names[3];
names[3]=names[4];
names[4]=t;
for
Is this amazon question buddy??
On Fri, May 11, 2012 at 5:24 PM, mayur mayursa...@gmail.com wrote:
Hi all,
I am stuck with a question for a long time...can someone provide the best
algorithm for this..
Question).. find all the anagrams in a list of words. The algorithm should
be efficient
