Thread: Sort A String Alphabetically.

One problem is that len1 is uninitialized, leaving the loops exit condition pretty random and probably resulting in a much larger len1 than you expected.

Anyway, even if len1 was OK, a looks like this.

a[0][0] = str[0]
a[1][1] = str[1]
a[2][2] = str[2]
...
a[len1 - 1][len1 - 1] = str[len1 - 1]

Which is not contiguous like a string. You should think of it as an array of arrays, so that when you access a[x] it results in the xth word.

So I guess more like

Code:

while (str[i] != 0) {
   if (isspace(str[i])) {
      a[k++][z] = 0;
   }
   else {
      a[k][z++] = str[i];
   }
   ++i;
}

The trickiest part of your job is probably managing the memory for the array you'll need to store the words. Unless you'll be able to anticipate the length of the program's input every time it runs, you'll have to have to use dynamic memory allocation, like in this example. In the example on lines 62-65, memory for word storage is allocated dynamically based on a rough word count; the word count is retained for when the allocated memory needs to be freed later on lines 79-81.

Another thing you should be cognizant of is the possibility of words which begin similarly but have different endings.

Consider:

Code:

Enter string: I love living in my country mang I also like manganese

For a case sensitive lexicographical ordering, you might get something like this:

Code:

I
I
also
country
in
like
living
love
mang
manganese
my