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: 109fba,1042f393323e22da X-Google-Attributes: gid109fba,public X-Google-Thread: 103376,1042f393323e22da X-Google-Attributes: gid103376,public X-Google-Thread: 1014db,1042f393323e22da X-Google-Attributes: gid1014db,public From: Steve Furlong Subject: Re: Any research putting c above ada? Date: 1997/05/05 Message-ID: <336E51EB.6275@pti-us.com.nospam>#1/1 X-Deja-AN: 239556539 References: <5ih6i9$oct$1@waldorf.csc.calpoly.edu> <33674E4C.446B@cca.rockwell.com> <5k88b3$340@bcrkh13.bnr.ca> <3368A6FE.41C6@cca.rockwell.com> <5kaqd4$m9b@bcrkh13.bnr.ca> <3369FCAF.41C6@cca.rockwell.com> Organization: Power Technologies, Inc. Newsgroups: comp.lang.c++,comp.lang.c,comp.lang.ada Date: 1997-05-05T00:00:00+00:00 List-Id: Jon S Anthony wrote: ... > Most of what passes as > so called "computer science" is just watered down mathematics - > discrete mathematics... And poorly done, at that. If I see one more O(n) algorithm for finding a Fibonacci number... (For those of you who didn't take Discrete Math, you can find a Fib. number in O(c) time.) Steve Furlong