UVa - 3225 - Circular Sequence

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <string.h>

using namespace std;
bool cmp(char str1[],char str2[])
{
    return strcmp(str1,str2) < 0;
}
//ACGT
void Sort(char a[])
{
    char **s;
    int len = strlen(a);
    s = (char **)malloc(sizeof(char *)*(len+1));
    int i,j;
    for(i = 0;i < len;i++)
        s[i] = (char *)malloc(sizeof(char)*(len+1));
    int flag = 0;
    while(flag < len)
    {
        j = 0;
        for(i = flag;i < len;i++)
            s[flag][j++] = a[i];

        for(i = 0;i < flag;i++)
                s[flag][j++] = a[i];

        s[flag][j] = '\0';

        //printf("s[%d] = %s\n",flag,s[flag]);
        flag++;
    }
    sort(s,s+len,cmp);
    printf("%s\n",s[0]);
    for(i = 0;i < len;i++)
        free(s[i]);
    free(s);
}

int main()
{
    int n;
    scanf("%d",&n);
    getchar();
    int i,j;
    for(i = 0; i < n;i++)
    {
        char D[105];
        gets(D);
        Sort(D);
        memset(D,0,sizeof(D));
    }
    return 0;
}