From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: fc89c,97188312486d4578
X-Google-Attributes: gidfc89c,public
X-Google-Thread: 109fba,baaf5f793d03d420
X-Google-Attributes: gid109fba,public
X-Google-Thread: 1014db,6154de2e240de72a
X-Google-Attributes: gid1014db,public
X-Google-Thread: 103376,97188312486d4578
X-Google-Attributes: gid103376,public
From: smosha@most.fw.hac.com (Stephen M O'Shaughnessy)
Subject: Re: What's the best language to start with? [was: Re: Should I learn
 C or Pascal?]
Date: 1996/08/06
Message-ID: <DvpvAM.5oJ@most.fw.hac.com>#1/1
X-Deja-AN: 172459405
sender: usenet@most.fw.hac.com
x-nntp-posting-host: smosha
references: 
 <sperlman-0507961717550001@p121.ezo.net><01bb73e3.1c6a0060$6bf467ce@dave.iceslimited.com><1996Jul20.124025.122789@kuhub.cc.ukans.edu><tequila-2007961836190001@tequila.interlog.com><01bb7b06$311fabc0$87ee6fce@timpent.airshields.com><dewar.
 <peake.206.002D549F@dstos3.dsto.gov.au><31FF57AE.52BFA1D7@sh.bel.alcatel.be>
 <qqg268at31.fsf@tartarus.ucsd.edu>
 <01bb7fcc$c5a98de0$87ee6fce@timpent.airshields.com>
 <DvH2MI.n40@most.fw.hac.com> <01bb80f6$e02d5cc0$9cee6fce@timhome2>
organization: MESC
mime-version: 1.0
newsgroups: comp.lang.c,comp.lang.c++,comp.unix.programmer,comp.lang.ada
Date: 1996-08-06T00:00:00+00:00
List-Id: <comp.lang.ada>


In article <01bb80f6$e02d5cc0$9cee6fce@timhome2>, tim@airshields.com says...
>
>Stephen M O'Shaughnessy <smosha@most.fw.hac.com> wrote in article
><DvH2MI.n40@most.fw.hac.com>...
>> In article <01bb7fcc$c5a98de0$87ee6fce@timpent.airshields.com>, 
>> tim@airshields.com says...
>> Learn sorting algorithms in assembly?  Are you serious!?
>
>Quite serious, but why would think sorting algorithms are
>especially hard?  That class of algorithm would have identical
>difficult in C or Asm.
>
>-- Tim Behrendsen (tim@airshields.com)

I don't think sorting is hard.  When I learned sorting, I sorted a deck of
cards.  I would not want to create an abstract data type in assembler.  I
have not done it, but I can't imagine it would be fun. 

The basic alog. might be the same in any language, the theory, but I doubt
that the actual implementation of a real world sorting problem would be 
the same.