
15-02-2007, 08:15
|
|
|
|
חבר מתאריך: 18.01.05
הודעות: 180
|
|
|
ככה -
int i=0,j ,m;
char * arr[1000] = NULL;
char buffer[500];
//kelet:
char answer;
do
{
printf("wonna add to array?\n");
scanf("%d",&answer);
if(answer == 'y')
{
scanf("%s",buffer);
arr[i] = (char* ) malloc ((strlen(buffer)+1)*sizeof(char));
strcpy(arr[i], buffer);
}
i++;
}
while(answer == 'y');
//sorting (i = number of elements in arr)
//this is bubble sort
for(j=i; j>=0;j--)
for(m = j; m<i-1;m++)
{
if(strcmp(arr[m],arr[m-1])<0)
swap(&arr[m],&arr[m-1]);
}
//now definition of swap:
void swap(char** a,char ** b)
{
char* temp;
strcpy(temp , *b);
strcpy(*b , *a);
strcpy(*b , temp);
}
|