I found several examples of what I was looking to do, but none worked quite exactly how I wanted, of course.
I'm trying to modify the following program to display all possible combinations of a string of words. So, for example:
*str = "one two"; // would be:
one two
two one
*str = "one two three"; // would be:
one two three
one three two
two one three
two three one
three one two
three two one
etc..
Here is what I am working with, which produces duplicates as well, which I do not want.
#include <stdio.h>
#include <string.h>
/* Function to swap values at two pointers */
void swap(char *x, char *y)
{
    char temp;
    temp = *x;
    *x = *y;
    *y = temp;
}
/* Function to print permutations of string
   This function takes three parameters:
   1. String
   2. Starting index of the string
   3. Ending index of the string. */
void permute(char *a, int l, int r)
{
   int i;
   if (l == r)
     printf("%s\n", a);
   else
   {
       for (i = l; i <= r; i++)
       {
          swap((a+l), (a+i));
          permute(a, l+1, r);
          swap((a+l), (a+i)); //backtrack
       }
   }
}
/* Driver program to test above functions */    
int main()
{
    char str[] = "one two three";
    int n = strlen(str);
    permute(str, 0, n-1);
    return 0;
}
 
    