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=0.2 required=5.0 tests=BAYES_00,INVALID_MSGID,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,9c86eb13dd395066
X-Google-Attributes: gid103376,public
From: Tom Moran <tmoran@bix.com>
Subject: Re: CRC in Ada?
Date: 1997/03/04
Message-ID: <331C5406.6533@bix.com>#1/1
X-Deja-AN: 223047521
References: <1997Mar2.220652@nova.wright.edu>
 <331bf6ce.2832564@news.logica.co.uk>
Organization: InterNex Information Services 1-800-595-3333
Reply-To: tmoran@bix.com
Newsgroups: comp.lang.ada
Date: 1997-03-04T00:00:00+00:00
List-Id: <comp.lang.ada>


> I found (exactly the same algorithm)
> implemented in C took an order of magnitude seconds less to execute
> than the Ada equivalent. 
  Was this a byte (or word) lookup or a bit shifting bit-at-a-time
algorithm?  Ada 83 wasn't real handy with bit shifting.