SilverWolf said:
I need some help with sorting and shuffling array of strings. I can't
seem to get qsort working, and I don't even know how to start to shuffle
the array. Here is what I have for now:
Not much, but it already has three errors, two of them
quite serious. I'll point them out and provide some hints
about how to fill in the rest -- hints only, because this
has a homework-y whiff to it ...
By the way, I'm not going to address the "shuffling"
question until you explain more clearly what you want to
do, and how you're going to decide whether an array is
"shuffled" or "unshuffled." For now, sorting only!
Since you want to sort, you'll probably want to use the
qsort() library function. And since the things to be sorted
are strings, you'll probably want to use the strcmp() function
to compare them. If so, include the appropriate headers:
#include <stdlib.h>
#include said:
(Sigh.) For the INT_MAX'th time: main() returns an `int'
to indicate whether the program completed successfully or
otherwise. Read all about it in your favorite C reference --
but if that reference advocates `void main', get a different
reference. Use the pages of the old one while seated in the
smallest room of your house, in such a way that they wind up
behind you.
{
char lines[100][100];
int count = 0, i;
while (gets(lines[count]))
++count;
Two serious errors in two lines. The first is that you
are using the deadly gets() function; see Question 12.23 in
the comp.lang.c Frequently Asked Questions (FAQ) list
http://www.eskimo.com/~scs/C-faq/s12.html
.... to learn why you should never do this.
The second error is similar in nature to the first, except
that you've written it yourself instead of inheriting it from
the library: What happens if somebody feeds 315 strings into
this program? You blindly try to fill a 100-place array with
215 more strings than it can hold, and there's no telling what
might happen. Most likely, the "overflow" strings will stomp
all over some other piece of memory and your program will crash,
but that's only if you're lucky.
Okay: If you've made it this far, you have an array holding
`count' 100-character strings. You can now use qsort() to put
them into order, like this:
qsort (lines, count, sizeof lines[0], compare_func);
The first argument is the array to be sorted, the second is the
number of strings in the array, the third is the number of bytes
in each string, and the last is the name of a comparison function.
"A comparison function," you ask? Yes: qsort() rearranges
the array in accordance with an ordering relation that you
define, and the way you define it is by providing a function.
This function accepts pointers to two array elements and decides
what their order should be in the sorted array. If the first
must precede the second, the function returns a negative value.
If the second must precede the first, the function returns a
positive value. If their order doesn't matter (they are "equal"
in all respects that are important to you), the function returns
zero.
Question 13.8 in the FAQ illustrates how to write such a
comparison function, *but* note that it is sorting an array of
pointers to strings, not an array of strings themselves as in
your case. The FAQ's code won't work for you -- in fact, the
FAQ's question wouldn't even arise for you! Ponder it anyhow,
to get an idea of how comparison functions work.
for (i = 0; i < count; ++i)
puts(lines);
Since main() returns an `int' (see above), you need a `return'
statement here. Any `int' at all will do, but you may confuse
your operating environment if you return some nonsensical status.
Three values that are guaranteed to make as much sense as possible
to the environment are zero (indicating success), EXIT_SUCCESS
(also indicating success, possibly in a different way), and
EXIT_FAILURE (indicating failure). The latter two values are
which you've already included in order to said:
You're welcome. Good luck!