Return to Answer

#C++ (112 non-ws chars)
Based on counting sort. Note: Assumes strings of the same length, which seems to be implied (though not stated) by the question.

int u[123], i; int a(char **c) { for(; c[0][i]; ) { u[c[0][i]]++; u[c[1][i++]]--; } for(i=0; i<123; )   if(u[i++]) return 0;  return 1; } 

#C++ (104 non-ws chars)
Based on counting sort. Note: Assumes strings of the same length, which seems to be implied (though not stated) by the question.

int u[123], i; int a(char **c) { for(; c[0][i]; ) { u[c[0][i]]++; u[c[1][i++]]--; } i=123; while(i && !u[--i]); return !i; } 

#C++ (114 non-ws chars)
Based on counting sort. Note: Assumes strings of the same length, which seems to be implied (though not stated) by the question.

int u[123], i=0; int a(char **c) { for(; c[0][i]; ) { u[c[0][i]]++; u[c[1][i++]]--; } for(i=0; i<123; ) if(u[i++]) return 0; return 1; } 

#C++ (112 non-ws chars)
Based on counting sort. Note: Assumes strings of the same length, which seems to be implied (though not stated) by the question.

int u[123], i; int a(char **c) { for(; c[0][i]; ) { u[c[0][i]]++; u[c[1][i++]]--; } for(i=0; i<123; ) if(u[i++]) return 0; return 1; } 

C++ (112 chars)

Based on counting sort. Note: Assumes strings of the same length, which seems to be implied (though not stated) by the question. I might change it later.

int u[123], i=0; int a(char **c) { for(; c[0][i]; ) { u[c[0][i]]++; u[c[1][i++]]--; } for(i=0; i<123; ) if(u[i++]) return 0; return 1; } 

#C++ (114 non-ws chars)
Based on counting sort. Note: Assumes strings of the same length, which seems to be implied (though not stated) by the question.

int u[123], i=0; int a(char **c) { for(; c[0][i]; ) { u[c[0][i]]++; u[c[1][i++]]--; } for(i=0; i<123; ) if(u[i++]) return 0; return 1; }