Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!bbn!rochester!ur-tut!ur-cvsvax!srs!dan
From: dan@srs.UUCP (Dan Kegel)
Newsgroups: comp.unix.wizards
Subject: Modest proposal (was: Re: Why doesn't this qsort example work? :-)
Message-ID: <414@srs.UUCP>
Date: Tue, 20-Oct-87 09:36:00 EST
Article-I.D.: srs.414
Posted: Tue Oct 20 09:36:00 1987
Date-Received: Fri, 30-Oct-87 00:53:30 EST
References: <7527@g.ms.uky.edu> <7377@alice.UUCP>
Organization: S.R.Systems
Lines: 21

> In article <7527@g.ms.uky.edu>, sean@ukma.UUCP writes:
> > I'm trying to use qsort for the first time and I'm having a bit of trouble.
> Try
> 	qsort(&t[0], 2, sizeof(struct tstr), compar);
> As you wrote it, you're calling compar with no arguments.
> Presto, instant core dump!

I bet sean got about fifty replies to his question.

It seems to me that any easy question to the net yields far too many
responses; people all try to answer the question at the same time.

Why don't we start a collision-avoidance convention?
If you see an easy question, and you want to answer it, roll a
twenty-sided die; if it comes up 1, answer the question; otherwise
wait to see if somebody else does first.

The only drawback I see to this is that the people who can answer the
Really Tough Questions think all questions are easy :-)

- Dan 'irate citizen' Kegel