Anyone with simplier coding than this..

[kenni81]

Anyone can explain and write out a simplier code of similiar function to the one below...the code is to invert the individual words in a sentence.

#include<stdio.h>
#define SP ' '

char*p(char*t)
{
char*s;
*t&&*t!=SP&&((s=p(t+1))==s)&&putchar(*t);
return(*t?(*t==SP?t:s):NULL);
}

int main(void)
{
char*t="i am ok";
while(t=p(t))
putchar(*t++);
}

[Polymorphic OOP]

Depends on what you mean by simpler.

#include<stdio.h>

void p( const char* t )
{
    const char *s,*f;
    for(s=t-1;;s=t=f)
    {
        while(*++t&&*t!=' ');
        for(f=t;--t!=s;putchar(*t));
        if(*f) putchar(' ');
        else break;
    }
}


int main(void)
{
    p("i am ok");
    return 0;
}

Also, it differs in that it doesn't check for a pointer to 0 as it's not necissary. That type of checking should be done prior to passing it to the function. If you want it, just add a single if statement to the function.

EDIT: Kept to obscure variable names for the hell of it

[Monster]

> Depends on what you mean by simpler.

He I've seen this code before.... let me see...
http://www.cprogramming.com/cboard/s...threadid=33737

We were just making fun... (see my second post on that thread)

[kenni81]

bad?..looks alrite though...

[quzah]

Reading the last post in the provided thread...

There is a reason I used recursion: I tend not to just give away the answer to people's homework. I specificly wrote hard to follow code for that exact reason. It provides the solution, but if you can understand what it's doing, then you don't really need to be asking the question.

Quzah.