On Tue, 09 May 2023 14:06:27 -0400, Janis Papanagnou <janis_papanagnou+ng@hotmail.com> wrote:

> On 09.05.2023 19:41, Martin Τrautmann wrote:
>> On Tue, 09 May 2023 10:54:09 -0400, Benjamin Esham wrote:
>>> Ah, I think I understand. What you are calling the "first" sort is the
>>> "innermost" sort, i.e., the sort that is applied *last*, and only if it is
>>> necessary to break the tie between two rows that have been considered equal
>>> by all of the previous sorting steps.
>>
>> Yeah, that's it. And the proper sort command had been given before:
>>
>> sort -t\; -k4,4n -k2,2 -k3,3
>
> In that light it's interesting how long (in time and number of posts)
> this thread got. ;-)

Easy to check as I use leafnode. :-)

# grep ^'Subject:' /var/spool/news/comp/unix/shell/*|grep 'sort by multiple columns'|wc -l
85

First post ...
Message-ID: <slrnu3v5vd.m2.t-usenet@ID-685.user.individual.de>
From: Martin =?UTF-8?Q?=CE=A4rautmann?= <t-usenet@gmx.net>
Newsgroups: comp.unix.shell
Subject: sort by multiple columns
Date: Wed, 19 Apr 2023 09:27:12 +0200

Regards, Dave Hodgins

On Tue, 09 May 2023 14:41:33 -0400, David W. Hodgins wrote:
> On Tue, 09 May 2023 14:06:27 -0400, Janis Papanagnou <janis_papanagnou+ng@hotmail.com> wrote:
>
>> On 09.05.2023 19:41, Martin Τrautmann wrote:
>>> On Tue, 09 May 2023 10:54:09 -0400, Benjamin Esham wrote:
>>>> Ah, I think I understand. What you are calling the "first" sort is the
>>>> "innermost" sort, i.e., the sort that is applied *last*, and only if it is
>>>> necessary to break the tie between two rows that have been considered equal
>>>> by all of the previous sorting steps.
>>>
>>> Yeah, that's it. And the proper sort command had been given before:
>>>
>>> sort -t\; -k4,4n -k2,2 -k3,3
>>
>> In that light it's interesting how long (in time and number of posts)
>> this thread got. ;-)
>
> Easy to check as I use leafnode. :-)
>
> # grep ^'Subject:' /var/spool/news/comp/unix/shell/*|grep 'sort by multiple columns'|wc -l
> 85

But the result would not have been sorted properly yet. Maybe you could
use sort to sort the digits suitably first, then use awk to compute the
correct checksum?

On Tue, 09 May 2023 16:46:26 -0400, Martin Τrautmann <t-usenet@gmx.net> wrote:
> On Tue, 09 May 2023 14:41:33 -0400, David W. Hodgins wrote:
>> Easy to check as I use leafnode. :-)
>>
>> # grep ^'Subject:' /var/spool/news/comp/unix/shell/*|grep 'sort by multiple columns'|wc -l
>> 85
>
> But the result would not have been sorted properly yet. Maybe you could
> use sort to sort the digits suitably first, then use awk to compute the
> correct checksum?

:-)

Regards, Dave Hodgins

Janis Papanagnou wrote:

> On 09.05.2023 19:41, Martin Τrautmann wrote:
>> On Tue, 09 May 2023 10:54:09 -0400, Benjamin Esham wrote:
>>> Ah, I think I understand. What you are calling the "first" sort is the
>>> "innermost" sort, i.e., the sort that is applied *last*, and only if it is
>>> necessary to break the tie between two rows that have been considered equal
>>> by all of the previous sorting steps.
>>
>> Yeah, that's it. And the proper sort command had been given before:
>>
>> sort -t\; -k4,4n -k2,2 -k3,3
>
> In that light it's interesting how long (in time and number of posts)
> this thread got. ;-)

Partly my fault, sorry everyone :-) I was catching up with the newsgroup
after a while and missed that the "right answer" had already been posted.

Benjamin