NYLXS - Free Software Events

Thu Nov 21 23:28:21 2024

EVENTS

FREE
SOFTWARE
INSTITUTE

POLITICS

JOBS

MEMBERS'
CORNER

MAILING
LIST

NYLXS Mailing Lists and Archives

NYLXS Members have a lot to say and share but we don't keep many secrets. Join the Hangout Mailing List and say your peice.

DATE 2016-11-01

LEARN

2024-11-21 | 2024-10-21 | 2024-09-21 | 2024-08-21 | 2024-07-21 | 2024-06-21 | 2024-05-21 | 2024-04-21 | 2024-03-21 | 2024-02-21 | 2024-01-21 | 2023-12-21 | 2023-11-21 | 2023-10-21 | 2023-09-21 | 2023-08-21 | 2023-07-21 | 2023-06-21 | 2023-05-21 | 2023-04-21 | 2023-03-21 | 2023-02-21 | 2023-01-21 | 2022-12-21 | 2022-11-21 | 2022-10-21 | 2022-09-21 | 2022-08-21 | 2022-07-21 | 2022-06-21 | 2022-05-21 | 2022-04-21 | 2022-03-21 | 2022-02-21 | 2022-01-21 | 2021-12-21 | 2021-11-21 | 2021-10-21 | 2021-09-21 | 2021-08-21 | 2021-07-21 | 2021-06-21 | 2021-05-21 | 2021-04-21 | 2021-03-21 | 2021-02-21 | 2021-01-21 | 2020-12-21 | 2020-11-21 | 2020-10-21 | 2020-09-21 | 2020-08-21 | 2020-07-21 | 2020-06-21 | 2020-05-21 | 2020-04-21 | 2020-03-21 | 2020-02-21 | 2020-01-21 | 2019-12-21 | 2019-11-21 | 2019-10-21 | 2019-09-21 | 2019-08-21 | 2019-07-21 | 2019-06-21 | 2019-05-21 | 2019-04-21 | 2019-03-21 | 2019-02-21 | 2019-01-21 | 2018-12-21 | 2018-11-21 | 2018-10-21 | 2018-09-21 | 2018-08-21 | 2018-07-21 | 2018-06-21 | 2018-05-21 | 2018-04-21 | 2018-03-21 | 2018-02-21 | 2018-01-21 | 2017-12-21 | 2017-11-21 | 2017-10-21 | 2017-09-21 | 2017-08-21 | 2017-07-21 | 2017-06-21 | 2017-05-21 | 2017-04-21 | 2017-03-21 | 2017-02-21 | 2017-01-21 | 2016-12-21 | 2016-11-21 | 2016-10-21 | 2016-09-21 | 2016-08-21 | 2016-07-21 | 2016-06-21 | 2016-05-21 | 2016-04-21 | 2016-03-21 | 2016-02-21 | 2016-01-21 | 2015-12-21 | 2015-11-21 | 2015-10-21 | 2015-09-21 | 2015-08-21 | 2015-07-21 | 2015-06-21 | 2015-05-21 | 2015-04-21 | 2015-03-21 | 2015-02-21 | 2015-01-21 | 2014-12-21 | 2014-11-21 | 2014-10-21

Key: Value:

Key: Value:

MESSAGE

DATE	2016-11-10
FROM	Christopher League
SUBJECT	Re: [Learn] merge sort parallel hw
From learn-bounces-at-nylxs.com Thu Nov 10 00:00:25 2016 Return-Path: X-Original-To: archive-at-mrbrklyn.com Delivered-To: archive-at-mrbrklyn.com Received: from www.mrbrklyn.com (www.mrbrklyn.com [96.57.23.82]) by mrbrklyn.com (Postfix) with ESMTP id 8CFA8161312; Thu, 10 Nov 2016 00:00:25 -0500 (EST) X-Original-To: learn-at-nylxs.com Delivered-To: learn-at-nylxs.com Received: from liucs.net (contrapunctus.net [174.136.110.10]) by mrbrklyn.com (Postfix) with ESMTP id C0E81161311 for ; Thu, 10 Nov 2016 00:00:21 -0500 (EST) Received: from localhost (pool-74-101-138-109.nycmny.fios.verizon.net [74.101.138.109]) by liucs.net (Postfix) with ESMTPSA id 3B4C6E097; Thu, 10 Nov 2016 00:00:20 -0500 (EST) From: Christopher League To: Ruben Safir , learn-at-nylxs.com In-Reply-To: <9c3e75e5-b83a-229b-867c-dcc364df895d-at-mrbrklyn.com> References: <6714100a-3ebd-8129-b8bc-6d1db3ae59be-at-mrbrklyn.com> <877f8ccf4h.fsf-at-contrapunctus.net> <9c3e75e5-b83a-229b-867c-dcc364df895d-at-mrbrklyn.com> User-Agent: Notmuch/0.21 (http://notmuchmail.org) Emacs/25.1.1 (x86_64-unknown-linux-gnu) Date: Thu, 10 Nov 2016 00:00:19 -0500 Message-ID: <874m3gc4kc.fsf-at-contrapunctus.net> MIME-Version: 1.0 Subject: Re: [Learn] merge sort parallel hw X-BeenThere: learn-at-nylxs.com X-Mailman-Version: 2.1.17 Precedence: list List-Id: List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Content-Type: multipart/mixed; boundary="===============0308526433==" Errors-To: learn-bounces-at-nylxs.com Sender: "Learn" --===============0308526433== Content-Type: multipart/alternative; boundary="=-=-=" --=-=-= Content-Type: text/plain Ruben Safir writes: > An array slice is an interesting thought. I can't believe you 'inspired' me to spend a couple hours coding C++. But merge sort is really fun I guess, and I liked my slice idea. See code at And here's the output for SIZE 19. Notice the nice tree structure of the log messages, based on the depth of the recursion. ~~~~ sort (0-19)[0 711 910 912 58 954 63 122 28 668 501 616 496 791 944 902 757 604 91] sort (0-9)[0 711 910 912 58 954 63 122 28] sort (0-4)[0 711 910 912] sort (0-2)[0 711] sort (0-1)[0] sort (1-2)[711] merge (0-2)[0 711] sort (2-4)[910 912] sort (2-3)[910] sort (3-4)[912] merge (2-4)[910 912] merge (0-4)[0 711 910 912] sort (4-9)[58 954 63 122 28] sort (4-6)[58 954] sort (4-5)[58] sort (5-6)[954] merge (4-6)[58 954] sort (6-9)[63 122 28] sort (6-7)[63] sort (7-9)[122 28] sort (7-8)[122] sort (8-9)[28] merge (7-9)[28 122] merge (6-9)[28 63 122] merge (4-9)[28 58 63 122 954] merge (0-9)[0 28 58 63 122 711 910 912 954] sort (9-19)[668 501 616 496 791 944 902 757 604 91] sort (9-14)[668 501 616 496 791] sort (9-11)[668 501] sort (9-10)[668] sort (10-11)[501] merge (9-11)[501 668] sort (11-14)[616 496 791] sort (11-12)[616] sort (12-14)[496 791] sort (12-13)[496] sort (13-14)[791] merge (12-14)[496 791] merge (11-14)[496 616 791] merge (9-14)[496 501 616 668 791] sort (14-19)[944 902 757 604 91] sort (14-16)[944 902] sort (14-15)[944] sort (15-16)[902] merge (14-16)[902 944] sort (16-19)[757 604 91] sort (16-17)[757] sort (17-19)[604 91] sort (17-18)[604] sort (18-19)[91] merge (17-19)[91 604] merge (16-19)[91 604 757] merge (14-19)[91 604 757 902 944] merge (9-19)[91 496 501 604 616 668 757 791 902 944] merge (0-19)[0 28 58 63 91 122 496 501 604 616 668 711 757 791 902 910 912 944 954] RESULT: (0-19)[0 28 58 63 91 122 496 501 604 616 668 711 757 791 902 910 912 944 954] ~~~~ --=-=-= Content-Type: text/html; charset=utf-8 Content-Transfer-Encoding: quoted-printable 1.0, user-scalable=3Dyes"> Ruben Safir ruben-at-mrbrklyn.com= writes: An array slice is an interesting thought. I can=E2=80=99t believe you =E2=80=98inspired=E2=80=99 me to spend a cou= ple hours coding C++. But merge sort is really fun I guess, and I liked my = slice idea. See code at 62d84642ae08197b4d229eb" class=3D"uri">https://gist.github.com/league/ce470= 244962d84642ae08197b4d229eb And here=E2=80=99s the output for SIZE 19. Notice the nice tree structur= e of the log messages, based on the depth of the recursion. sort (0-19)[0 711 910 912 58 954 63 122 28 668 501 616 496 791 9= 44 902 757 604 91] sort (0-9)[0 711 910 912 58 954 63 122 28] sort (0-4)[0 711 910 912] sort (0-2)[0 711] sort (0-1)[0] sort (1-2)[711] merge (0-2)[0 711] sort (2-4)[910 912] sort (2-3)[910] sort (3-4)[912] merge (2-4)[910 912] merge (0-4)[0 711 910 912] sort (4-9)[58 954 63 122 28] sort (4-6)[58 954] sort (4-5)[58] sort (5-6)[954] merge (4-6)[58 954] sort (6-9)[63 122 28] sort (6-7)[63] sort (7-9)[122 28] sort (7-8)[122] sort (8-9)[28] merge (7-9)[28 122] merge (6-9)[28 63 122] merge (4-9)[28 58 63 122 954] merge (0-9)[0 28 58 63 122 711 910 912 954] sort (9-19)[668 501 616 496 791 944 902 757 604 91] sort (9-14)[668 501 616 496 791] sort (9-11)[668 501] sort (9-10)[668] sort (10-11)[501] merge (9-11)[501 668] sort (11-14)[616 496 791] sort (11-12)[616] sort (12-14)[496 791] sort (12-13)[496] sort (13-14)[791] merge (12-14)[496 791] merge (11-14)[496 616 791] merge (9-14)[496 501 616 668 791] sort (14-19)[944 902 757 604 91] sort (14-16)[944 902] sort (14-15)[944] sort (15-16)[902] merge (14-16)[902 944] sort (16-19)[757 604 91] sort (16-17)[757] sort (17-19)[604 91] sort (17-18)[604] sort (18-19)[91] merge (17-19)[91 604] merge (16-19)[91 604 757] merge (14-19)[91 604 757 902 944] merge (9-19)[91 496 501 604 616 668 757 791 902 944] merge (0-19)[0 28 58 63 91 122 496 501 604 616 668 711 757 791 902 910 912 = 944 954] RESULT: (0-19)[0 28 58 63 91 122 496 501 604 616 668 711 757 791 902 910 91= 2 944 954] --=-=-=-- --===============0308526433== Content-Type: text/plain; charset="us-ascii" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Disposition: inline _______________________________________________ Learn mailing list Learn-at-nylxs.com http://lists.mrbrklyn.com/mailman/listinfo/learn --===============0308526433==--