Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.c > #146566 > unrolled thread
| Started by | DFS <nospam@dfs.com> |
|---|---|
| First post | 2019-10-04 13:00 -0400 |
| Last post | 2019-10-15 11:19 -0700 |
| Articles | 20 on this page of 483 — 31 participants |
Back to article view | Back to comp.lang.c
Sort char array DFS <nospam@dfs.com> - 2019-10-04 13:00 -0400
Re: Sort char array scott@slp53.sl.home (Scott Lurndal) - 2019-10-04 17:06 +0000
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-04 21:55 +0300
Re: Sort char array DFS <nospam@dfs.com> - 2019-10-04 19:24 -0400
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-05 13:08 +0300
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-04 21:06 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-05 01:21 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-05 01:23 +0100
Re: Sort char array DFS <nospam@dfs.com> - 2019-10-04 20:49 -0400
Re: Sort char array DFS <nospam@dfs.com> - 2019-10-04 20:45 -0400
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-05 13:14 +0100
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-05 14:35 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-05 17:12 +0100
Re: Sort char array luser droog <luser.droog@gmail.com> - 2019-10-05 09:26 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-05 17:51 +0100
Re: Sort char array chad <cdalten@gmail.com> - 2019-10-15 09:00 -0700
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-15 19:29 +0300
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-05 18:13 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-05 21:09 +0100
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-05 13:22 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-05 21:45 +0100
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-06 00:17 +0100
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-06 16:32 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-06 15:54 +0100
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-06 08:07 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-06 17:39 +0100
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-06 12:52 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-06 21:26 +0100
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-07 01:37 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-07 01:10 +0100
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-06 17:32 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-07 02:02 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-07 09:41 +0200
Re: Sort char array mark.bluemel@gmail.com - 2019-10-07 00:39 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-07 10:59 +0100
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-07 13:19 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-07 12:42 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-07 13:57 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-07 15:01 +0100
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-07 17:42 +0300
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-07 17:20 +0100
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-07 19:33 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-07 18:22 +0100
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-08 02:27 +0300
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-07 17:02 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-08 08:53 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-08 12:28 +0100
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-08 11:47 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-09 02:02 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-09 00:50 +0100
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-10 03:03 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-10 01:51 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-10 10:31 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-10 11:57 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-10 14:24 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-10 14:41 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-10 16:17 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-10 18:09 +0100
Re: Sort char array scott@slp53.sl.home (Scott Lurndal) - 2019-10-10 17:38 +0000
Re: Sort char array already5chosen@yahoo.com - 2019-10-10 01:37 -0700
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-10 11:05 -0700
Re: Sort char array Lew Pitcher <lew.pitcher@digitalfreehold.ca> - 2019-10-10 14:33 -0400
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-10 12:20 -0700
Re: Sort char array Lew Pitcher <lew.pitcher@digitalfreehold.ca> - 2019-10-10 16:00 -0400
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-10 23:43 +0300
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-10 14:12 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-11 01:04 +0300
Re: Sort char array scott@slp53.sl.home (Scott Lurndal) - 2019-10-10 22:17 +0000
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-10 15:24 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-10 12:57 +0100
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-11 00:53 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-11 00:50 +0100
Re: Sort char array Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2019-10-12 03:42 +0800
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-11 22:16 +0100
Re: Sort char array raltbos@xs4all.nl (Richard Bos) - 2019-10-14 16:08 +0000
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-14 19:20 +0100
Re: Sort char array Ian Collins <ian-news@hotmail.com> - 2019-10-15 07:40 +1300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-14 20:24 +0100
Re: Sort char array Ian Collins <ian-news@hotmail.com> - 2019-10-15 08:33 +1300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-14 20:52 +0100
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-14 16:18 -0700
Re: Sort char array scott@slp53.sl.home (Scott Lurndal) - 2019-10-14 23:42 +0000
Re: Sort char array Ian Collins <ian-news@hotmail.com> - 2019-10-15 16:40 +1300
Re: Sort char array chad <cdalten@gmail.com> - 2019-10-15 05:10 -0700
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-14 12:00 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-09 12:33 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-09 14:22 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-09 15:35 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-09 16:15 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-09 20:24 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-09 20:42 +0100
Re: Sort char array already5chosen@yahoo.com - 2019-10-09 10:40 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-09 20:31 +0200
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-09 12:02 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-09 22:21 +0200
Re: Sort char array scott@slp53.sl.home (Scott Lurndal) - 2019-10-09 21:31 +0000
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-09 15:35 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-10 00:32 +0300
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-10 10:40 +0200
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-10 10:42 -0700
Re: Sort char array already5chosen@yahoo.com - 2019-10-10 15:58 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-13 21:37 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-13 19:56 +0100
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-14 00:56 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-14 11:04 +0100
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-14 13:33 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-18 10:57 +0100
Re: Sort char array mark.bluemel@gmail.com - 2019-10-18 05:56 -0700
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-18 06:10 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-18 15:24 +0200
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-18 09:41 -0400
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-18 07:20 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-18 15:29 +0100
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-19 06:04 -0700
Re: Sort char array scott@slp53.sl.home (Scott Lurndal) - 2019-10-18 13:36 +0000
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-18 15:17 +0100
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-18 16:44 +0100
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-18 08:49 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-18 17:56 +0200
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-18 09:03 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-18 19:14 +0200
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-18 23:45 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-18 23:06 +0100
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-18 23:45 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-19 00:49 +0100
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-19 01:19 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-19 11:16 +0100
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-19 03:56 -0700
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-19 13:29 +0100
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-19 08:44 -0400
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-19 14:05 +0100
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-19 07:35 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-19 18:01 +0100
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-19 20:14 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-19 23:12 +0100
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-20 00:45 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-20 10:24 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-20 14:39 +0200
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-20 06:11 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-20 15:36 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-20 14:36 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-20 16:47 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-20 19:16 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-20 21:37 +0200
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-20 09:54 -0400
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-19 13:24 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-19 13:40 +0100
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-19 13:13 -0700
Re: Sort char array already5chosen@yahoo.com - 2019-10-19 13:57 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-20 15:04 +0200
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-20 06:21 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-20 15:40 +0200
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-20 07:29 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-20 16:49 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-20 15:10 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-20 21:26 +0200
Re: Sort char array Melzzzzz <Melzzzzz@zzzzz.com> - 2019-10-20 19:56 +0000
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-20 23:06 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-20 23:08 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-21 00:25 +0200
Re: Sort char array Melzzzzz <Melzzzzz@zzzzz.com> - 2019-10-20 22:33 +0000
Re: Sort char array Melzzzzz <Melzzzzz@zzzzz.com> - 2019-10-20 22:57 +0000
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-21 00:14 +0100
Re: Sort char array Melzzzzz <Melzzzzz@zzzzz.com> - 2019-10-20 23:48 +0000
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-21 11:20 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-21 12:36 +0100
Re: Sort char array Melzzzzz <Melzzzzz@zzzzz.com> - 2019-10-20 22:48 +0000
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-21 01:20 +0200
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-22 18:00 +0200
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-22 10:51 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-22 19:19 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-20 21:27 +0100
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-20 14:46 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-20 23:34 +0100
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-18 16:35 +0100
Re: Sort char array Melzzzzz <Melzzzzz@zzzzz.com> - 2019-10-18 17:01 +0000
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-18 19:15 +0200
Re: Sort char array Melzzzzz <Melzzzzz@zzzzz.com> - 2019-10-18 19:01 +0000
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-20 13:14 +0200
Re: Sort char array Melzzzzz <Melzzzzz@zzzzz.com> - 2019-10-20 11:25 +0000
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-20 15:07 +0200
Re: Sort char array Melzzzzz <Melzzzzz@zzzzz.com> - 2019-10-18 16:58 +0000
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-14 08:06 -0700
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-14 19:55 +0300
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-15 03:24 +0100
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-15 12:39 +0300
Re: Sort char array already5chosen@yahoo.com - 2019-10-15 04:03 -0700
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-15 14:30 +0100
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-18 05:59 -0700
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-19 00:31 +0100
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-23 04:46 -0700
Re: Sort char array already5chosen@yahoo.com - 2019-10-14 12:06 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-11 10:30 +0200
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-11 02:26 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-11 12:41 +0200
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-11 11:34 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-12 12:06 +0200
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-12 11:55 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-13 13:23 +0200
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-13 13:30 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-14 16:13 +0200
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-11 02:00 +0300
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-11 10:33 +0200
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-10 01:01 -0700
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-10 11:19 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-10 12:18 +0100
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-10 16:15 +0100
Re: Sort char array scott@slp53.sl.home (Scott Lurndal) - 2019-10-10 15:32 +0000
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-10 21:03 +0100
Re: Sort char array scott@slp53.sl.home (Scott Lurndal) - 2019-10-10 20:36 +0000
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-10 17:16 +0100
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-11 03:25 +0100
Re: Sort char array David Kleinecke <dkleinecke@gmail.com> - 2019-10-10 22:36 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-11 12:10 +0100
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-12 00:26 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-12 00:44 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-12 12:18 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-12 12:42 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-12 15:00 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-12 15:29 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-12 19:13 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-12 19:04 +0100
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-12 20:13 -0400
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-13 01:36 +0100
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-12 22:52 -0400
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-12 23:06 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-13 10:25 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-13 16:42 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-13 18:03 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-13 19:50 +0200
Re: Sort char array already5chosen@yahoo.com - 2019-10-14 12:27 -0700
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-15 10:26 +0200
Re: Sort char array Ike Naar <ike@sdf.lonestar.org> - 2019-10-14 21:02 +0000
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-14 01:39 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-14 01:51 +0100
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-14 12:16 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-14 10:45 +0100
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-14 13:16 +0300
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-14 03:34 -0700
Lack of language I/O support (was Re: Sort char array, many posts ago) mark.bluemel@gmail.com - 2019-10-14 03:54 -0700
Re: Lack of language I/O support (was Re: Sort char array, many posts ago) scott@slp53.sl.home (Scott Lurndal) - 2019-10-14 13:36 +0000
Re: Lack of language I/O support (was Re: Sort char array, many posts ago) Lew Pitcher <lew.pitcher@digitalfreehold.ca> - 2019-10-14 09:49 -0400
Re: Lack of language I/O support (was Re: Sort char array, many posts ago) mark.bluemel@gmail.com - 2019-10-14 07:15 -0700
Re: Lack of language I/O support (was Re: Sort char array, many posts ago) scott@slp53.sl.home (Scott Lurndal) - 2019-10-14 14:55 +0000
Re: Lack of language I/O support (was Re: Sort char array, many posts ago) mark.bluemel@gmail.com - 2019-10-14 08:10 -0700
Re: Lack of language I/O support (was Re: Sort char array, many posts ago) scott@slp53.sl.home (Scott Lurndal) - 2019-10-14 16:21 +0000
Re: Lack of language I/O support (was Re: Sort char array, many posts ago) Siri Cruise <chine.bleu@yahoo.com> - 2019-10-14 09:25 -0700
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-14 14:57 +0300
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-14 08:24 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-14 16:40 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-14 16:17 +0200
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-14 23:45 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-15 00:03 +0100
Re: Sort char array Thiago Adams <thiago.adams@gmail.com> - 2019-10-14 05:30 -0700
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-14 16:05 +0300
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-14 07:55 -0700
Re: Sort char array Thiago Adams <thiago.adams@gmail.com> - 2019-10-14 10:58 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-14 14:36 +0100
Re: Sort char array Thiago Adams <thiago.adams@gmail.com> - 2019-10-14 11:03 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-14 19:28 +0100
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-14 08:17 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-15 00:26 +0300
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-15 11:55 +0300
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-16 04:24 -0700
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-16 07:19 -0700
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-16 18:17 +0300
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-17 05:43 -0700
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-17 18:01 +0300
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-19 00:39 +0300
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-19 06:00 -0700
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-11-08 18:38 +0300
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-11-08 22:03 -0800
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-12 18:49 -0400
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-13 00:25 +0100
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-12 23:44 -0400
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-12 13:45 +0100
Re: Sort char array James Kuyper <jameskuyper@alumni.caltech.edu> - 2019-10-13 19:05 -0400
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-12 13:16 -0700
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-13 00:12 +0100
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-13 14:18 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-13 23:10 +0100
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-14 23:52 -0400
Re: Sort char array James Kuyper <jameskuyper@alumni.caltech.edu> - 2019-10-15 11:48 -0400
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-15 18:14 +0100
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-15 20:31 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-15 20:11 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-15 20:34 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-15 22:05 +0200
Re: Sort char array already5chosen@yahoo.com - 2019-10-15 13:27 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-16 10:11 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-16 12:42 +0200
Re: Sort char array already5chosen@yahoo.com - 2019-10-16 04:02 -0700
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-17 05:51 -0700
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-18 10:18 -0400
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-18 12:05 -0700
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-23 05:42 -0700
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-23 05:02 -0700
Re: Sort char array raltbos@xs4all.nl (Richard Bos) - 2019-10-14 15:32 +0000
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-14 08:57 -0700
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-14 10:13 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-14 23:59 +0300
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-17 06:08 -0700
Re: Sort char array already5chosen@yahoo.com - 2019-10-10 01:20 -0700
Re: Sort char array James Kuyper <jameskuyper@alumni.caltech.edu> - 2019-10-10 20:15 -0400
Re: Sort char array already5chosen@yahoo.com - 2019-10-11 04:00 -0700
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-11 07:53 -0400
Re: Sort char array James Kuyper <jameskuyper@alumni.caltech.edu> - 2019-10-11 11:20 -0400
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-11 11:16 -0700
Re: Sort char array James Kuyper <jameskuyper@alumni.caltech.edu> - 2019-10-11 14:43 -0400
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-11 11:51 -0700
Re: Sort char array raltbos@xs4all.nl (Richard Bos) - 2019-10-12 07:46 +0000
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-12 09:49 -0400
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-12 12:29 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-12 12:20 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-12 13:38 +0200
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-12 12:17 -0700
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-12 20:20 -0400
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-12 20:39 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-13 21:32 +0300
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-14 07:38 -0400
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-14 08:13 -0700
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-15 07:45 -0400
Re: Sort char array chad <cdalten@gmail.com> - 2019-10-15 05:12 -0700
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-15 13:04 -0700
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-17 10:14 -0700
Re: Sort char array James Kuyper <jameskuyper@alumni.caltech.edu> - 2019-10-15 12:24 -0400
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-16 04:12 -0700
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-16 14:21 -0700
Re: Sort char array James Kuyper <jameskuyper@alumni.caltech.edu> - 2019-10-16 19:12 -0400
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-16 16:33 -0700
Re: Sort char array James Kuyper <jameskuyper@alumni.caltech.edu> - 2019-10-16 19:48 -0400
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-18 06:57 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-13 21:22 +0300
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-11 01:02 +0300
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-07 17:01 +0200
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-07 12:24 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-07 12:18 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-07 14:11 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-07 15:22 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-07 17:17 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-07 20:52 +0100
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-08 00:45 +0300
Re: Sort char array already5chosen@yahoo.com - 2019-10-07 15:57 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-08 02:32 +0300
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-08 10:06 +0200
Re: Sort char array already5chosen@yahoo.com - 2019-10-08 03:21 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-09 00:34 +0300
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-08 11:23 +0200
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-08 09:59 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-08 11:39 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-08 14:05 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-08 15:06 +0100
Re: Sort char array scott@slp53.sl.home (Scott Lurndal) - 2019-10-08 14:38 +0000
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-08 17:34 +0200
Re: Sort char array scott@slp53.sl.home (Scott Lurndal) - 2019-10-08 16:38 +0000
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-08 07:55 -0700
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-08 18:31 +0300
Re: Sort char array scott@slp53.sl.home (Scott Lurndal) - 2019-10-08 16:39 +0000
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-08 19:57 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-08 18:09 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-08 22:16 +0200
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-08 23:58 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-08 22:19 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-08 17:39 +0200
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-09 00:12 +0300
Re: Sort char array already5chosen@yahoo.com - 2019-10-09 09:48 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-09 19:49 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-08 17:29 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-08 17:56 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-08 22:25 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-09 00:02 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-09 13:41 +0200
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-09 14:03 +0100
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-09 15:53 +0200
Re: Sort char array scott@slp53.sl.home (Scott Lurndal) - 2019-10-09 14:39 +0000
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-09 15:58 +0100
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-10 22:43 +0100
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-11 01:45 +0300
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-11 01:00 +0100
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-12 12:01 -0400
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-12 20:35 +0100
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-13 21:17 +0300
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-14 07:45 -0400
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-14 14:53 +0300
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-09 02:02 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-09 10:36 +0100
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-07 09:05 -0700
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-07 08:59 -0700
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-07 09:00 -0700
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-07 17:02 +0100
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-06 19:57 -0400
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-09 06:38 -0700
Re: Sort char array Bart <bc@freeuk.com> - 2019-10-05 17:14 +0100
Re: Sort char array DFS <nospam@dfs.com> - 2019-10-05 13:06 -0400
Re: Sort char array already5chosen@yahoo.com - 2019-10-06 02:24 -0700
Re: Sort char array already5chosen@yahoo.com - 2019-10-06 05:13 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-06 16:04 +0300
Re: Sort char array already5chosen@yahoo.com - 2019-10-06 07:13 -0700
Re: Sort char array DFS <nospam@dfs.com> - 2019-10-06 18:23 -0400
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-06 15:41 +0300
Re: Sort char array Keith Thompson <kst-u@mib.org> - 2019-10-06 12:46 -0700
Re: Sort char array Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2019-10-07 04:00 +0800
Re: Sort char array David Brown <david.brown@hesbynett.no> - 2019-10-07 09:46 +0200
Re: Sort char array DFS <nospam@dfs.com> - 2019-10-07 22:49 -0400
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-08 12:24 +0300
Re: Sort char array DFS <nospam@dfs.com> - 2019-10-08 09:28 -0400
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-08 23:49 +0300
Re: Sort char array DFS <nospam@dfs.com> - 2019-10-08 18:18 -0400
Re: Sort char array already5chosen@yahoo.com - 2019-10-08 03:34 -0700
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-08 14:36 +0300
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-08 15:34 +0300
Re: Sort char array already5chosen@yahoo.com - 2019-10-08 05:54 -0700
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-08 16:01 +0300
Re: Sort char array already5chosen@yahoo.com - 2019-10-08 06:31 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-09 00:30 +0300
Re: Sort char array already5chosen@yahoo.com - 2019-10-09 10:14 -0700
Re: Sort char array already5chosen@yahoo.com - 2019-10-08 06:26 -0700
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-05 02:46 +0100
Re: Sort char array DFS <nospam@dfs.com> - 2019-10-05 00:19 -0400
Re: Sort char array Barry Schwarz <schwarzb@dqel.com> - 2019-10-04 22:26 -0700
Re: OT Re: Sort char array Barry Schwarz <schwarzb@delq.com> - 2019-10-05 06:33 -0700
Re: Sort char array Bonita Montero <Bonita.Montero@gmail.com> - 2019-10-05 16:46 +0200
Re: Sort char array "Oliver S." <Follow.Me@gmx.net> - 2019-10-05 16:54 +0200
Re: Sort char array "Oliver S." <Follow.Me@gmx.net> - 2019-10-05 17:14 +0200
Re: Sort char array DFS <nospam@dfs.com> - 2019-10-05 11:34 -0400
Re: Sort char array Mateusz Viste <mateusz@wont.tell> - 2019-10-05 15:43 +0000
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-05 17:29 -0400
Re: Sort char array already5chosen@yahoo.com - 2019-10-06 02:14 -0700
Re: Sort char array Mateusz Viste <mateusz@wont.tell> - 2019-10-06 09:58 +0000
Re: Sort char array already5chosen@yahoo.com - 2019-10-06 03:11 -0700
Re: Sort char array already5chosen@yahoo.com - 2019-10-06 03:35 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-06 15:57 +0300
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-06 16:12 +0100
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-09 02:06 -0700
Re: Sort char array Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2019-10-07 07:28 -0700
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-07 17:51 +0100
Re: Sort char array Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2019-10-08 18:31 +0800
Re: Sort char array already5chosen@yahoo.com - 2019-10-08 03:59 -0700
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-09 02:14 -0700
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-08 14:34 +0300
Re: Sort char array Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2019-10-08 22:41 +0800
Re: Sort char array already5chosen@yahoo.com - 2019-10-06 02:03 -0700
Re: Sort char array Bonita Montero <Bonita.Montero@gmail.com> - 2019-10-06 13:25 +0200
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-06 15:45 +0300
Re: Sort char array Bonita Montero <Bonita.Montero@gmail.com> - 2019-10-06 14:59 +0200
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-06 16:11 +0300
Re: Sort char array Bonita Montero <Bonita.Montero@gmail.com> - 2019-10-06 15:15 +0200
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-06 16:20 +0300
Re: Sort char array Bonita Montero <Bonita.Montero@gmail.com> - 2019-10-06 15:35 +0200
Re: Sort char array Richard Damon <Richard@Damon-Family.org> - 2019-10-06 13:04 -0400
Re: Sort char array already5chosen@yahoo.com - 2019-10-06 08:44 -0700
Re: Sort char array Bonita Montero <Bonita.Montero@gmail.com> - 2019-10-06 18:01 +0200
Re: Sort char array already5chosen@yahoo.com - 2019-10-06 09:42 -0700
Re: Sort char array Bonita Montero <Bonita.Montero@gmail.com> - 2019-10-06 19:21 +0200
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-06 21:51 +0100
Re: Sort char array Bonita Montero <Bonita.Montero@gmail.com> - 2019-10-07 04:41 +0200
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-07 16:45 +0100
Re: Sort char array Anton Shepelev <anton.txt@g{oogle}mail.com> - 2019-10-07 19:11 +0300
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-07 21:10 +0100
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-08 00:43 +0300
Re: Sort char array James Kuyper <jameskuyper@alumni.caltech.edu> - 2019-10-07 15:51 -0400
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-09 01:48 -0700
Re: Sort char array James Kuyper <jameskuyper@alumni.caltech.edu> - 2019-10-07 00:42 -0400
Re: Sort char array John Bode <jfbode1029@gmail.com> - 2019-10-07 16:05 -0700
Re: Sort char array DFS <nospam@dfs.com> - 2019-10-07 20:06 -0400
Re: Sort char array John Bode <jfbode1029@gmail.com> - 2019-10-08 08:34 -0700
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-08 01:09 +0100
Re: Sort char array DFS <nospam@dfs.com> - 2019-10-07 20:12 -0400
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-08 01:44 +0100
Re: Sort char array DFS <nospam@dfs.com> - 2019-10-07 22:02 -0400
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-08 03:24 +0100
Re: Sort char array Ben Bacarisse <ben.usenet@bsb.me.uk> - 2019-10-09 01:42 +0100
Re: Sort char array John Bode <jfbode1029@gmail.com> - 2019-10-09 11:14 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-10 00:52 +0300
Re: Sort char array John Bode <jfbode1029@gmail.com> - 2019-10-08 08:20 -0700
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-09 00:20 +0300
Re: Sort char array James Kuyper <jameskuyper@alumni.caltech.edu> - 2019-10-08 18:48 -0400
Re: Sort char array Anton Shepelev <anton.txt@gmail.com> - 2019-10-09 02:07 +0300
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-09 02:29 -0700
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-09 09:43 -0700
Re: Sort char array already5chosen@yahoo.com - 2019-10-09 09:37 -0700
Re: Sort char array Tim Rentsch <tr.17687@z991.linuxsc.com> - 2019-10-09 02:22 -0700
Re: Sort char array already5chosen@yahoo.com - 2019-10-15 11:19 -0700
Page 21 of 25 — ← Prev page 1 … 19 20 [21] 22 23 … 25 Next page →
| From | Keith Thompson <kst-u@mib.org> |
|---|---|
| Date | 2019-10-06 12:46 -0700 |
| Message-ID | <lnd0f9wtbp.fsf@kst-u.example.com> |
| In reply to | #146625 |
Anton Shepelev <anton.txt@gmail.com> writes:
[...]
> Sound like the work for radix sort, does it not? My quick-
> and-dirty implementation of it, however, loses by a factor
> of ten to the standard qsort() even with gcc -O5 and extra
> large arrays:
[...]
gcc's highest optimization level is -O3. (There are also switches for
more specific optimization options.) Apparently anything above 3 is
quietly treated as -O3, though as far as I can tell that's not
documented.
It's probably intended to allow for higher levels in future releases,
but -O3 has been the maximum for a very long time.
--
Keith Thompson (The_Other_Keith) kst-u@mib.org <http://www.ghoti.net/~kst>
Will write code for food.
void Void(void) { Void(); } /* The recursive call of the void */
[toc] | [prev] | [next] | [standalone]
| From | Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> |
|---|---|
| Date | 2019-10-07 04:00 +0800 |
| Message-ID | <QJrmF.752734$3x5.182884@fx14.am4> |
| In reply to | #146656 |
On 07/10/2019 3:46 am, Keith Thompson wrote: > gcc's highest optimization level is -O3. (There are also switches for > more specific optimization options.) Apparently anything above 3 is > quietly treated as -O3, though as far as I can tell that's not > documented. > > It's probably intended to allow for higher levels in future releases, > but -O3 has been the maximum for a very long time. Back when I first started using GCC[2], the highest level was -O2. Back then it was somewhere documented that optimization levels -O3 to -O9 would be treated as -O2. I have assumed the same place still documents this, but I could be wrong. The GNU project has a long history of bad documentation. [2] It's been more than 20 years now. -- Johann | email: invalid -> com | www.myrkraverk.com/blog/ I'm not from the Internet, I just work there. | twitter: @myrkraverk
[toc] | [prev] | [next] | [standalone]
| From | David Brown <david.brown@hesbynett.no> |
|---|---|
| Date | 2019-10-07 09:46 +0200 |
| Message-ID | <qneqgn$qd3$1@dont-email.me> |
| In reply to | #146656 |
On 06/10/2019 21:46, Keith Thompson wrote: > Anton Shepelev <anton.txt@gmail.com> writes: > [...] >> Sound like the work for radix sort, does it not? My quick- >> and-dirty implementation of it, however, loses by a factor >> of ten to the standard qsort() even with gcc -O5 and extra >> large arrays: > [...] > > gcc's highest optimization level is -O3. (There are also switches for > more specific optimization options.) Apparently anything above 3 is > quietly treated as -O3, though as far as I can tell that's not > documented. > > It's probably intended to allow for higher levels in future releases, > but -O3 has been the maximum for a very long time. > Also note that -O3 optimisation does not necessarily mean the code will be faster than -O2. In particular, -O3 does a lot more loop unrolling and expanding than -O2. That will be faster for some cases, but slower (especially due to overuse of the various caches and buffers in the cpu) in other cases. Usually there is little to be gained from going over -O2 - individual flags that match your particular code are likely to be more useful.
[toc] | [prev] | [next] | [standalone]
| From | DFS <nospam@dfs.com> |
|---|---|
| Date | 2019-10-07 22:49 -0400 |
| Message-ID | <xOSmF.34457$1A2.368@fx07.iad> |
| In reply to | #146625 |
On 10/6/2019 8:41 AM, Anton Shepelev wrote:
> DFS:
>
>> I actually want to sort 12,000,000 random string elements
>> of length 2 to 16. No kidding. python does it in about 30
>> seconds (Timsort algorithm) on my old computer.
>
> Sound like the work for radix sort, does it not?
Don't know. Is radix a good sort method for random strings of various
lengths? And I forgot to mention I want to sort on lowercase.
> My quick-
> and-dirty implementation of it, however, loses by a factor
> of ten to the standard qsort() even with gcc -O5 and extra
> large arrays:
>
> #include <stdlib.h>
> #include <string.h>
> #include <limits.h>
>
> typedef struct lstring /* stores C-strings with their lengths */
> { char* _;
> int len;
> } t_lstring;
>
> static void histsort /* Histogram sorting */
> ( int r, /* radix */
> int n, /* number of elements to sort */
> unsigned char bucks[], /* stores the bucket for each element of `in' */
> t_lstring in[], /* input array to sort by radix `r' */
> t_lstring out[] /* the output (sorted) array */
> )
> { int hist[ 256 ]; /* the histogram -- number of elements per bucket */
> int i, b; /* array element and bucket indices */
> char c; /* character at radix `r' in an array element */
> t_lstring* ls; /* pointer to an array element */
>
> /* 1. Initialise the histogram: */
> for( b = 0; b <= 255; b += 1 )
> { hist[ b ] = 0; }
>
> /* 2. Fill the histogram: */
> for( i = 0; i < n; i += 1 )
> { ls = &in[i];
> if( r < ls->len ) c = ls->_[r];
> else c = CHAR_MIN; /* if there is no character at r */
>
> b = c - CHAR_MIN; /* convert to zero-based index */
> bucks[i] = b;
> hist[b] += 1;
> }
>
> /* 3. Convert the histogram to cumulative distibution: */
> for( b = 1; b <= 255; b += 1 )
> { hist[b] += hist[ b - 1 ]; }
> /* Not hist[b] contains the the number of elements in bucket b and all the */
> /* previous ones, which is also the last index in the output array of an */
> /* element in that bucket plus unity. */
>
> /* 4. Output the elements in the order of the buckets: */
> /* Since each bucket is filled in reverse order, we must scan the array */
> /* likewise, lest we invert the existing ordering by previous radixi. */
> for( i = n-1; i >= 0; i -= 1 )
> { b = bucks[i];
> hist[b] -= 1; /* now it points to the last free element for bucket `b'. */
> out[ hist[b] ] = in[i]; /* data transfer through stack! */
> }
> }
>
> static void rsort( int n, char** x )
> { int i; /* index of the current element */
> int l, m; /* current and maximum string legth */
> int r; /* radix, or character position in a string. */
> t_lstring *lstabi, *lstabo; /* input and output lstring tables */
> t_lstring *lstabt; /* temp pointer for swaping */
> t_lstring *ls; /* pointer to an element */
> unsigned char * bucks; /* bucket array */
>
> /* 1. Allocate memory for additional structures: */
> /* TODO: Test for lack of memory and return an error code: */
> lstabi = calloc( n, sizeof( t_lstring ) );
> lstabo = calloc( n, sizeof( t_lstring ) );
> bucks = calloc( n, sizeof( char ) );
>
> m = 0;
> /* 2. Fill the input array calulating maximum string length by the way: */
> for( i = 0; i < n; i += 1 )
> { l = strlen( x[i] );
> if( l > m )
> { m = l; }
> ls = &lstabi[i];
> ls->_ = x[i];
> ls->len = l;
> }
>
> /* 3. Histogram-sorting starting from the highest meaningful radix */
> /* to get the enforce lexicographical order: */
> for( r = m-1; r >= 0; r -= 1 )
> { histsort( r, n, bucks, lstabi, lstabo );
> lstabt = lstabi; /* Swap the input and output tables */
> lstabi = lstabo; /* in order in the next iteration */
> lstabo = lstabt; /* to sort the output of the current. */
> }
>
> /* 4. Return the element into the array: */
> for( i = 0; i < n; i += 1 )
> { x[i] = lstabi[i]._; }
>
> free( lstabi );
> free( lstabo );
> free( bucks );
> }
>
> Now I too want to ask: what did I do wrong? I do not have a
> test code I am not ahsamed of, so am not publishing any so
> far.
I dropped your code into mine, and it compiles fine on tcc (Windows),
but throws what I think is a segfault as soon as the call is made to rsort.
The Windows error message is very helpful, as you can see:
https://imgur.com/a/421iygP
In the pic, the command line "rands 100 6 12 radixsort" means create 100
random strings of random length between 6 and 12 and sort using your
radix code.
[toc] | [prev] | [next] | [standalone]
| From | Anton Shepelev <anton.txt@g{oogle}mail.com> |
|---|---|
| Date | 2019-10-08 12:24 +0300 |
| Message-ID | <20191008122424.2ee500ff86830386885545a6@g{oogle}mail.com> |
| In reply to | #146724 |
DFS: >Is radix a good sort method for random strings of various >lengths? It theoretically very good for sorting lots of short random strings, which seems to be your case. >And I forgot to mention I want to sort on lowercase. That can be taken into account. >I dropped your code into mine, and it compiles fine on tcc >(Windows), but throws what I think is a segfault as soon as >the call is made to rsort. I added a tiny main() funciton to test my code: https://pastebin.com/raw/n96jQ2Lh and it seems to work. I don't have my larger test program at hand, but will post it later. Can you share a small and easily compilable program that makes my function fail? -- () ascii ribbon campaign - against html e-mail /\ http://preview.tinyurl.com/qcy6mjc [archived]
[toc] | [prev] | [next] | [standalone]
| From | DFS <nospam@dfs.com> |
|---|---|
| Date | 2019-10-08 09:28 -0400 |
| Message-ID | <C90nF.17972$hU2.13534@fx20.iad> |
| In reply to | #146731 |
On 10/8/2019 5:24 AM, Anton Shepelev wrote:
> DFS:
>
>> Is radix a good sort method for random strings of various
>> lengths?
>
> It theoretically very good for sorting lots of short random
> strings, which seems to be your case.
>
>> And I forgot to mention I want to sort on lowercase.
>
> That can be taken into account.
>
>> I dropped your code into mine, and it compiles fine on tcc
>> (Windows), but throws what I think is a segfault as soon as
>> the call is made to rsort.
>
> I added a tiny main() funciton to test my code:
>
> https://pastebin.com/raw/n96jQ2Lh
>
> and it seems to work. I don't have my larger test program
> at hand, but will post it later. Can you share a small and
> easily compilable program that makes my function fail?
I just created a subset of my program with your radix sort and now it works.
Replace your main() with the code below.
compile: $ tcc -o anton.exe random_strings_clc_Anton.c
run: $ anton N L H
N = # of random strings to create
L = low end of random string size
H = high end of random string size
ie $ anton 1000 6 12
I ran it for 12000000 8 16 and counted in my head to around 26s, so I
think it's faster than qsort.
sorted data
1. 0000APH3e6iKgCH
2. 00038tcVfZKz3ylY
3. 0003lTrm2
4. 0004PGvmKgyViKj
5. 00057VVL3nBlmHn
6. 0005D4JuI
7. 0007nIfKi
8. 000AAgYXork
9. 000AIaDd
10. 000BRNNWaHrVws5
11999991. zzznM01byU
11999992. zzzrbsRgTdUpFpU
11999993. zzzs5F2FLnQJ
11999994. zzzuMJhg
11999995. zzzuqHL92i4rQ
11999996. zzzvwN6N
11999997. zzzwvnUtTY9
11999998. zzzxbTIfAtqhgN
11999999. zzzxfhrtfgSCBR
12000000. zzzzeLwXyCt
Done
------------------------------------------------------------------------------
int i=0, j=0, k=0;
char charset[62] =
"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
short charsetLen = 62;
//get random number from within range
int randNbr(int low, int high) {
return (low + rand() / (RAND_MAX / (high - low + 1) + 1));
}
//build random string of random length
char *randStr(int randLen) {
char *randStr = NULL;
randStr = malloc(sizeof(char) * (randLen + 1));
for(i=0; i<randLen; i++) {
randStr[i] = charset[randNbr(0,charsetLen-1)];
}
randStr[randLen] = '\0';
return randStr;
}
int main(int argc, char *argv[])
{
int arrsize = atoi(argv[1]);
int lo = atoi(argv[2]);
int hi = atoi(argv[3]);
char **randoms = malloc(sizeof(char*) * arrsize);
srand(time(NULL));
for(j=0;j<arrsize;j++) {randoms[j] = randStr(randNbr(lo,hi));}
printf("\nsorting...\n");
rsort(arrsize,randoms);
printf("\nsorted data\n");
for(i=0;i<arrsize;i++) {
if (i<10 || i>(arrsize-11))
printf("%d. %s\n",i+1, randoms[i]);
}
free(randoms);
printf("Done");
exit(0);
}
------------------------------------------------------------------------------
[toc] | [prev] | [next] | [standalone]
| From | Anton Shepelev <anton.txt@gmail.com> |
|---|---|
| Date | 2019-10-08 23:49 +0300 |
| Message-ID | <20191008234944.002b41c85006b25ed4f193c2@gmail.com> |
| In reply to | #146745 |
DFS:
> I just created a subset of my program with your radix sort
> and now it works.
Great, but I am still unsure as to whose fault it was that
it crashed.
> Replace your main() with the code below.
> //build random string of random length
> char *randStr(int randLen) {
> char *randStr = NULL;
> randStr = malloc(sizeof(char) * (randLen + 1));
> for(i=0; i<randLen; i++) {
> randStr[i] = charset[randNbr(0,charsetLen-1)];
> }
> randStr[randLen] = '\0';
> return randStr;
> }
You need not malloc every string. Just declare a
sufficiently large array:
#define N 12000000
char holder [N][16];
char* data[N];
and fill it.
> I ran it for 12000000 8 16 and counted in my head to
> around 26s, so I think it's faster than qsort.
Very well, and I am certain that experienced programmers in
this newsgroup can write even better implementations, should
they so desire. By the way, you need not count in your
head, for C already provides a facility to measure CPU-time:
https://manned.org/clock.3posix .
Here is a simple function that measures the performance of a
rsort-compatible function and returns the average duration
of a call:
typedef void ( *f_sort )( int n, char** x );
static float gtm_measure( f_sort func, char** x, int n )
{ int i;
clock_t start, diff;
i = 0;
start = clock();
do
{ func( n, x );
diff = clock() - start;
i += 1;
}
while( diff < 5 * CLOCKS_PER_SEC );
return (float)diff / CLOCKS_PER_SEC / i;
}
--
() ascii ribbon campaign -- against html e-mail
/\ http://preview.tinyurl.com/qcy6mjc [archived]
[toc] | [prev] | [next] | [standalone]
| From | DFS <nospam@dfs.com> |
|---|---|
| Date | 2019-10-08 18:18 -0400 |
| Message-ID | <uW7nF.6663$eW2.873@fx25.iad> |
| In reply to | #146771 |
On 10/8/2019 4:49 PM, Anton Shepelev wrote:
> DFS:
>
>> I just created a subset of my program with your radix sort
>> and now it works.
>
> Great, but I am still unsure as to whose fault it was that
> it crashed.
The fault was on my end, I'm sure.
>> Replace your main() with the code below.
>> //build random string of random length
>> char *randStr(int randLen) {
>> char *randStr = NULL;
>> randStr = malloc(sizeof(char) * (randLen + 1));
>> for(i=0; i<randLen; i++) {
>> randStr[i] = charset[randNbr(0,charsetLen-1)];
>> }
>> randStr[randLen] = '\0';
>> return randStr;
>> }
>
> You need not malloc every string. Just declare a
> sufficiently large array:
> #define N 12000000
> char holder [N][16];
> char* data[N];
>
> and fill it.
OK
>> I ran it for 12000000 8 16 and counted in my head to
>> around 26s, so I think it's faster than qsort.
>
> Very well, and I am certain that experienced programmers in
> this newsgroup can write even better implementations, should
> they so desire. By the way, you need not count in your
> head, for C already provides a facility to measure CPU-time:
>
> https://manned.org/clock.3posix .
My code originally had Windows timing, which I took out to create that
main() for the test.
#include <Windows.h>
LARGE_INTEGER frequency,start,end;
double elapsedtime(LARGE_INTEGER startingtimer)
{
QueryPerformanceCounter(&end);
return (end.QuadPart - startingtimer.QuadPart) /
(double)frequency.QuadPart;
}
QueryPerformanceCounter(&start);
...
...
...
printf("%.6fs have elapsed\n",elapsedtime(start));
> Here is a simple function that measures the performance of a
> rsort-compatible function and returns the average duration
> of a call:
> typedef void ( *f_sort )( int n, char** x );
>
> static float gtm_measure( f_sort func, char** x, int n )
> { int i;
> clock_t start, diff;
>
> i = 0;
> start = clock();
> do
> { func( n, x );
> diff = clock() - start;
> i += 1;
> }
> while( diff < 5 * CLOCKS_PER_SEC );
> return (float)diff / CLOCKS_PER_SEC / i;
> }
Thanks
[toc] | [prev] | [next] | [standalone]
| From | already5chosen@yahoo.com |
|---|---|
| Date | 2019-10-08 03:34 -0700 |
| Message-ID | <643693e0-8ab3-4b5f-b765-5cff1bdec133@googlegroups.com> |
| In reply to | #146724 |
On Tuesday, October 8, 2019 at 5:49:09 AM UTC+3, DFS wrote:
> On 10/6/2019 8:41 AM, Anton Shepelev wrote:
> > DFS:
> >
> >> I actually want to sort 12,000,000 random string elements
> >> of length 2 to 16. No kidding. python does it in about 30
> >> seconds (Timsort algorithm) on my old computer.
> >
> > Sound like the work for radix sort, does it not?
>
> Don't know. Is radix a good sort method for random strings of various
> lengths?
If big majority of strings is short then I would guess that it is a good method.
> And I forgot to mention I want to sort on lowercase.
>
Then you sort preprocessed (converted to the lower case) copy of the original array.
>
>
>
> > My quick-
> > and-dirty implementation of it, however, loses by a factor
> > of ten to the standard qsort() even with gcc -O5 and extra
> > large arrays:
> >
> > #include <stdlib.h>
> > #include <string.h>
> > #include <limits.h>
> >
> > typedef struct lstring /* stores C-strings with their lengths */
> > { char* _;
> > int len;
> > } t_lstring;
> >
> > static void histsort /* Histogram sorting */
> > ( int r, /* radix */
> > int n, /* number of elements to sort */
> > unsigned char bucks[], /* stores the bucket for each element of `in' */
> > t_lstring in[], /* input array to sort by radix `r' */
> > t_lstring out[] /* the output (sorted) array */
> > )
> > { int hist[ 256 ]; /* the histogram -- number of elements per bucket */
> > int i, b; /* array element and bucket indices */
> > char c; /* character at radix `r' in an array element */
> > t_lstring* ls; /* pointer to an array element */
> >
> > /* 1. Initialise the histogram: */
> > for( b = 0; b <= 255; b += 1 )
> > { hist[ b ] = 0; }
> >
> > /* 2. Fill the histogram: */
> > for( i = 0; i < n; i += 1 )
> > { ls = &in[i];
> > if( r < ls->len ) c = ls->_[r];
> > else c = CHAR_MIN; /* if there is no character at r */
> >
> > b = c - CHAR_MIN; /* convert to zero-based index */
> > bucks[i] = b;
> > hist[b] += 1;
> > }
> >
> > /* 3. Convert the histogram to cumulative distibution: */
> > for( b = 1; b <= 255; b += 1 )
> > { hist[b] += hist[ b - 1 ]; }
> > /* Not hist[b] contains the the number of elements in bucket b and all the */
> > /* previous ones, which is also the last index in the output array of an */
> > /* element in that bucket plus unity. */
> >
> > /* 4. Output the elements in the order of the buckets: */
> > /* Since each bucket is filled in reverse order, we must scan the array */
> > /* likewise, lest we invert the existing ordering by previous radixi. */
> > for( i = n-1; i >= 0; i -= 1 )
> > { b = bucks[i];
> > hist[b] -= 1; /* now it points to the last free element for bucket `b'. */
> > out[ hist[b] ] = in[i]; /* data transfer through stack! */
> > }
> > }
> >
> > static void rsort( int n, char** x )
> > { int i; /* index of the current element */
> > int l, m; /* current and maximum string legth */
> > int r; /* radix, or character position in a string. */
> > t_lstring *lstabi, *lstabo; /* input and output lstring tables */
> > t_lstring *lstabt; /* temp pointer for swaping */
> > t_lstring *ls; /* pointer to an element */
> > unsigned char * bucks; /* bucket array */
> >
> > /* 1. Allocate memory for additional structures: */
> > /* TODO: Test for lack of memory and return an error code: */
> > lstabi = calloc( n, sizeof( t_lstring ) );
> > lstabo = calloc( n, sizeof( t_lstring ) );
> > bucks = calloc( n, sizeof( char ) );
> >
> > m = 0;
> > /* 2. Fill the input array calulating maximum string length by the way: */
> > for( i = 0; i < n; i += 1 )
> > { l = strlen( x[i] );
> > if( l > m )
> > { m = l; }
> > ls = &lstabi[i];
> > ls->_ = x[i];
> > ls->len = l;
> > }
> >
> > /* 3. Histogram-sorting starting from the highest meaningful radix */
> > /* to get the enforce lexicographical order: */
> > for( r = m-1; r >= 0; r -= 1 )
> > { histsort( r, n, bucks, lstabi, lstabo );
> > lstabt = lstabi; /* Swap the input and output tables */
> > lstabi = lstabo; /* in order in the next iteration */
> > lstabo = lstabt; /* to sort the output of the current. */
> > }
> >
> > /* 4. Return the element into the array: */
> > for( i = 0; i < n; i += 1 )
> > { x[i] = lstabi[i]._; }
> >
> > free( lstabi );
> > free( lstabo );
> > free( bucks );
> > }
> >
> > Now I too want to ask: what did I do wrong? I do not have a
> > test code I am not ahsamed of, so am not publishing any so
> > far.
>
> I dropped your code into mine, and it compiles fine on tcc (Windows),
> but throws what I think is a segfault as soon as the call is made to rsort.
>
> The Windows error message is very helpful, as you can see:
> https://imgur.com/a/421iygP
>
> In the pic, the command line "rands 100 6 12 radixsort" means create 100
> random strings of random length between 6 and 12 and sort using your
> radix code.
[toc] | [prev] | [next] | [standalone]
| From | Anton Shepelev <anton.txt@g{oogle}mail.com> |
|---|---|
| Date | 2019-10-08 14:36 +0300 |
| Message-ID | <20191008143632.19be45a1d3efbdec13d66c90@g{oogle}mail.com> |
| In reply to | #146734 |
already5chosen to DFS: >>And I forgot to mention I want to sort on lowercase. > >Then you sort preprocessed (converted to the lower case) >copy of the original array. Is it necessary? Convering case on-the-fly should be alogrithmically slower. -- () ascii ribbon campaign - against html e-mail /\ http://preview.tinyurl.com/qcy6mjc [archived]
[toc] | [prev] | [next] | [standalone]
| From | Anton Shepelev <anton.txt@g{oogle}mail.com> |
|---|---|
| Date | 2019-10-08 15:34 +0300 |
| Message-ID | <20191008153447.fec83b985e9e275527dc2160@g{oogle}mail.com> |
| In reply to | #146739 |
I wrote: >Is it necessary? Convering case on-the-fly should be >alogrithmically slower. I meant: "should not be alogrithmically slower." -- () ascii ribbon campaign - against html e-mail /\ http://preview.tinyurl.com/qcy6mjc [archived]
[toc] | [prev] | [next] | [standalone]
| From | already5chosen@yahoo.com |
|---|---|
| Date | 2019-10-08 05:54 -0700 |
| Message-ID | <06dffc3f-db8b-47da-8f3d-afc5335a3d0b@googlegroups.com> |
| In reply to | #146739 |
On Tuesday, October 8, 2019 at 2:36:40 PM UTC+3, Anton Shepelev wrote: > already5chosen to DFS: > > >>And I forgot to mention I want to sort on lowercase. > > > >Then you sort preprocessed (converted to the lower case) > >copy of the original array. > > Is it necessary? Convering case on-the-fly should be > alogrithmically slower. > > -- > () ascii ribbon campaign - against html e-mail > /\ http://preview.tinyurl.com/qcy6mjc [archived] I don't understand what you mean by "on-the-fly". My first attempt on DFS's task would be - 1. Create array of 8-byte records. Each record consists of 4 first characters of the original array converted to lower case and padded as necessary with zeros + 32-bit index of position in original array (possible because OP specified that there are only 10M strings. 2. Sort a new array with radix sort (LS digit first). It would take one count pass and 4 copy passes. 3. Sort sub-sections that still need it, i.e. that that contain 4 equal non-zero characters. In that phase use in-place algorithms that are appropriate for a length of the section, most likely straight insertion for short sections and qucksort for longer sections. In this phase I am not sure if case conversions is worth of preprocessing. One can try both variants. For randomly generated test cases this phase will almost never need to do anything. Not so many for real-world cases where identical prefixes are rathr common. 4. Build result array from the index part of result of phase (3). This algorithm will not work well when small number of 4-char prefixes in prevalent in the input data.
[toc] | [prev] | [next] | [standalone]
| From | Anton Shepelev <anton.txt@g{oogle}mail.com> |
|---|---|
| Date | 2019-10-08 16:01 +0300 |
| Message-ID | <20191008160104.78d98884c0979ddbf7ba9507@g{oogle}mail.com> |
| In reply to | #146742 |
already5chosen to Anton Shepelev: >>Convering case on-the-fly should [not] be alogrithmically >>slower. > >I don't understand what you mean by "on-the-fly". I meant conversion to lowercase inside the counting loop of radix sort, and resulting the calcualted value inside the sort-loop -- the one that scans the array and puts its elements into the order according to the histogram. -- () ascii ribbon campaign - against html e-mail /\ http://preview.tinyurl.com/qcy6mjc [archived]
[toc] | [prev] | [next] | [standalone]
| From | already5chosen@yahoo.com |
|---|---|
| Date | 2019-10-08 06:31 -0700 |
| Message-ID | <d96e5201-7696-4000-b5c7-f53755b00273@googlegroups.com> |
| In reply to | #146743 |
On Tuesday, October 8, 2019 at 4:01:16 PM UTC+3, Anton Shepelev wrote: > already5chosen to Anton Shepelev: > > >>Convering case on-the-fly should [not] be alogrithmically > >>slower. > > > >I don't understand what you mean by "on-the-fly". > > I meant conversion to lowercase inside the counting loop of > radix sort, and resulting the calcualted value inside the > sort-loop -- the one that scans the array and puts its > elements into the order according to the histogram. > > -- > () ascii ribbon campaign - against html e-mail > /\ http://preview.tinyurl.com/qcy6mjc [archived] o.k. With addition of [not] it makes more sense. BTW, it's not necessary to apply conversion during counting phase. Instead, it can be applied to histograms.
[toc] | [prev] | [next] | [standalone]
| From | Anton Shepelev <anton.txt@gmail.com> |
|---|---|
| Date | 2019-10-09 00:30 +0300 |
| Message-ID | <20191009003009.bb0befbbbdbf5c066bb9bd44@gmail.com> |
| In reply to | #146746 |
already5chosen:
> BTW, it's not necessary to apply conversion during
> counting phase. Instead, it can be applied to histograms.
How do you mean? Suppose I have the following histogram:
a A b B
3 1 5 2
Before I can proceed with sorting, I must convert it to:
a b
4 7
At the sorting stage, I must again convert my characters to
lowercase?
--
() ascii ribbon campaign -- against html e-mail
/\ http://preview.tinyurl.com/qcy6mjc [archived]
[toc] | [prev] | [next] | [standalone]
| From | already5chosen@yahoo.com |
|---|---|
| Date | 2019-10-09 10:14 -0700 |
| Message-ID | <e06b9a98-dfd6-45b5-a491-d4783eeb2b35@googlegroups.com> |
| In reply to | #146777 |
On Wednesday, October 9, 2019 at 12:30:21 AM UTC+3, Anton Shepelev wrote: > already5chosen: > > > BTW, it's not necessary to apply conversion during > > counting phase. Instead, it can be applied to histograms. > > How do you mean? Suppose I have the following histogram: > > a A b B > 3 1 5 2 > > Before I can proceed with sorting, I must convert it to: > > a b > 4 7 > > At the sorting stage, I must again convert my characters to > lowercase? > Yes. > -- > () ascii ribbon campaign -- against html e-mail > /\ http://preview.tinyurl.com/qcy6mjc [archived]
[toc] | [prev] | [next] | [standalone]
| From | already5chosen@yahoo.com |
|---|---|
| Date | 2019-10-08 06:26 -0700 |
| Message-ID | <b6e2bcd6-8dd2-42e6-a78f-cc33fce8e30d@googlegroups.com> |
| In reply to | #146742 |
On Tuesday, October 8, 2019 at 3:54:58 PM UTC+3, already...@yahoo.com wrote: > On Tuesday, October 8, 2019 at 2:36:40 PM UTC+3, Anton Shepelev wrote: > > already5chosen to DFS: > > > > >>And I forgot to mention I want to sort on lowercase. > > > > > >Then you sort preprocessed (converted to the lower case) > > >copy of the original array. > > > > Is it necessary? Convering case on-the-fly should be > > alogrithmically slower. > > > > -- > > () ascii ribbon campaign - against html e-mail > > /\ http://preview.tinyurl.com/qcy6mjc [archived] > > I don't understand what you mean by "on-the-fly". > > My first attempt on DFS's task would be - > > 1. Create array of 8-byte records. > Each record consists of 4 first characters of the original array converted to lower case and padded as necessary with zeros + 32-bit index of position in original array (possible because OP specified that there are only 10M strings. > 2. Sort a new array with radix sort (LS digit first). It would take one count pass and 4 copy passes. > 3. Sort sub-sections that still need it, i.e. that that contain 4 equal non-zero characters. In that phase use in-place algorithms that are appropriate for a length of the section, most likely straight insertion for short sections and qucksort for longer sections. In this phase I am not sure if case conversions is worth of preprocessing. One can try both variants. > For randomly generated test cases this phase will almost never need to do anything. Not so many for real-world cases where identical prefixes are rathr common. > 4. Build result array from the index part of result of phase (3). > > This algorithm will not work well when small number of 4-char prefixes in prevalent in the input data. On the 2nd thought, 10M * 8 = 80MB - that's much bigger than LLC caches of common CPUs. And store part of the LS-digit first radix sort will likely produce almost random access patterns. No good. Slow. It seems, for arrays of such size MS-digit first algorithms are preferable, despite their greater complexity. Or, may be, even O(N*logN) algorithms - a lot more operations, but much more cache/DRAM friendly access patterns.
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2019-10-05 02:46 +0100 |
| Message-ID | <87lfu0nevy.fsf@bsb.me.uk> |
| In reply to | #146576 |
Bart <bc@freeuk.com> writes:
> You might try this version:
>
> #include <stdlib.h> // for qsort
>
> int mystrcmp(char** s, char** t){
> return strcmp(*s, *t);
> }
Or, to keep the types on the level, the OP might prefer
int mystrcmp(const void *s, const void *t) {
return strcasecmp(*(char **)s, *(char **)t);
}
> void psort(int n, char *x[]) {
> qsort(x, n, sizeof(char*), mystrcmp);
> }
I'd write
qsort(x, n, sizeof x[0], mystrcmp);
just to avoid repeating the type again.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | DFS <nospam@dfs.com> |
|---|---|
| Date | 2019-10-05 00:19 -0400 |
| Message-ID | <8RUlF.15870$KB2.5051@fx02.iad> |
| In reply to | #146576 |
On 10/4/2019 8:21 PM, Bart wrote:
> On 04/10/2019 18:00, DFS wrote:
>> 1 void psort(int n,char *x[]) {
>> 2 char *temp;
>> 3 for(i=0;i<n;i++) {
>> 4 for(j=0;j<n;j++) {
>> 5 if(strcasecmp(x[j],x[i])>0) {
>> 6 temp = x[i];
>> 7 x[i] = x[j]);
>> 8 x[j] = temp;
>> 9 }
>> 10 }
>> 11 }
>> 12 }
>>
>>
>> This works, but is very slow. Like 6 seconds to sort an array of
>> 10,000 elements.
>>
>> What am I doing wrong?
>
> Just using a poor swap routine, if you do actually need to sort 10,000
> elements. (10 or 100 might be fine.)
>
> You might try this version:
>
> #include <stdlib.h> // for qsort
>
> int mystrcmp(char** s, char** t){
> return strcmp(*s, *t);
> }
>
> void psort(int n, char *x[]) {
** qsort(x, n, sizeof(char*), mystrcmp);
> }
** throws "warning: assignment from incompatible pointer type"
[toc] | [prev] | [next] | [standalone]
| From | Barry Schwarz <schwarzb@dqel.com> |
|---|---|
| Date | 2019-10-04 22:26 -0700 |
| Message-ID | <p7agpehv2p8vi7qp4n02rrk4dorbaa5ut8@4ax.com> |
| In reply to | #146581 |
On Sat, 5 Oct 2019 00:19:41 -0400, DFS <nospam@dfs.com> wrote:
>On 10/4/2019 8:21 PM, Bart wrote:
>> On 04/10/2019 18:00, DFS wrote:
>>> 1 void psort(int n,char *x[]) {
>>> 2 char *temp;
>>> 3 for(i=0;i<n;i++) {
>>> 4 for(j=0;j<n;j++) {
>>> 5 if(strcasecmp(x[j],x[i])>0) {
>>> 6 temp = x[i];
>>> 7 x[i] = x[j]);
>>> 8 x[j] = temp;
>>> 9 }
>>> 10 }
>>> 11 }
>>> 12 }
>>>
>>>
>>> This works, but is very slow. Like 6 seconds to sort an array of
>>> 10,000 elements.
>>>
>>> What am I doing wrong?
>>
>> Just using a poor swap routine, if you do actually need to sort 10,000
>> elements. (10 or 100 might be fine.)
>>
>> You might try this version:
>>
>> #include <stdlib.h> // for qsort
>>
>> int mystrcmp(char** s, char** t){
>> return strcmp(*s, *t);
>> }
>>
>> void psort(int n, char *x[]) {
>** qsort(x, n, sizeof(char*), mystrcmp);
>> }
>
>
>** throws "warning: assignment from incompatible pointer type"
Look at the declaration of qsort and change the type of mystrcmp to
what is required by the standard.
--
Remove del for email
[toc] | [prev] | [next] | [standalone]
Page 21 of 25 — ← Prev page 1 … 19 20 [21] 22 23 … 25 Next page →
Back to top | Article view | comp.lang.c
csiph-web