» About     » Archive     » Submit     » Authors     » Search     » Random     » Specials     » Statistics     » Forum     » Facebook     » RSS Feed     Updates Daily

No. 445: Computer Science: A Garfield Introduction

First | Previous | 2010-08-07 | Next | Latest

Computer Science: A Garfield Introduction

First | Previous | 2010-08-07 | Next | Latest

Strip by: Manyhills

Jon: {reading a "Comp Sci" book} The standard high school algorithm for multiplication is of complexity O(N2).
Jon: The Karatsuba algorithm gives a complexity of O(Nlog 3). That's the fastest one I know.
Jon: For sequential computing, anyway.
Garfield: Parallel computers can do it in O(log N), although they obviously require more processors.
Holly: {to Delkin, as Jim Davis} I think this textbook has affected your writing.

The author writes:

This textbook thing is of course this textbook thing.

Original strip: 2001-05-01.