mplement a func node *(char *word){}
wich returns a link list of words dat are anagrams with the input word..if
no anagrams found return NULL and add that word to the link list
given structure of list as
struct node {
struct node *next;
char val[101];
};
--
You received this message because you
So, in short, find all permutations for a given string and create a linked
list from them?
--
Anup Ghatage
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from
#include stdio.h
#include string.h
typedef struct node{
struct node *next;
char *str;
}node;
node *M;
void swap(char *a, char *b){
char t = *a;
*a = *b;
*b = t;
}
void add(char *str){
if(M == NULL){
M = (node *)malloc(sizeof(node));
M-str = (char
