#include #include void Quicksort(char data[], int left, int right){ int l = left, r = right; char pivot = data[(left + right) / 2]; char temp; while(1){ while (data[l] < pivot) l++; while (pivot < data[r]) r--; if(r < l) break; temp = data[l]; data[l] = data[r]; data[r] = temp; l++, r--; } if(left < r) Quicksort(data, left, r); if(l < right) Quicksort(data, l, right); } int main(void){ int i; int cnt = 0; char a[11], b[11]; scanf("%s", a); scanf("%s", b); int len = strlen(a); Quicksort(a, 0, len-1); Quicksort(b, 0, len-1); for(i=0;i