The following sections of this BookRags Literature Study Guide is offprint from Gale's For Students Series: Presenting Analysis, Context, and Criticism on Commonly Studied Works: Introduction, Author Biography, Plot Summary, Characters, Themes, Style, Historical Context, Critical Overview, Criticism and Critical Essays, Media Adaptations, Topics for Further Study, Compare & Contrast, What Do I Read Next?, For Further Study, and Sources.
(c)1998-2002; (c)2002 by Gale. Gale is an imprint of The Gale Group, Inc., a division of Thomson Learning, Inc. Gale and Design and Thomson Learning are trademarks used herein under license.
The following sections, if they exist, are offprint from Beacham's Encyclopedia of Popular Fiction: "Social Concerns", "Thematic Overview", "Techniques", "Literary Precedents", "Key Questions", "Related Titles", "Adaptations", "Related Web Sites". (c)1994-2005, by Walton Beacham.
The following sections, if they exist, are offprint from Beacham's Guide to Literature for Young Adults: "About the Author", "Overview", "Setting", "Literary Qualities", "Social Sensitivity", "Topics for Discussion", "Ideas for Reports and Papers". (c)1994-2005, by Walton Beacham.
All other sections in this Literature Study Guide are owned and copyrighted by BookRags, Inc.
An algorithm is a set of instructions which indicate a method for accomplishing a task. If followed correctly, an algorithm guarantees successful completion even without the use of any intelligence. The term algorithm is derived from the name Al-Khowarizmi, a ninth century Arabian mathematician who is credited for discovering algebra. With the advent of computers, which are particularly adept at utilizing algorithms, the creation of new and faster algorithms has become an important consideration in the study of theoretical computer science.
Algorithms can be written to solve any conceivable problem. For example, an algorithm can be developed for tying a shoe, making cookies, or determining the area of a circle. In an algorithm for tieing a shoe each step, from obtaining a shoe with a lace to releasing the string after it is tied, is spelled out. The individual steps are written in such a way that no judgement is ever required to successfully carry them out. The length of time required to complete an algorithm is directly dependent on the number of steps involved. The more steps, the longer it takes to complete. Consequently, algorithms are classified as fast or slow depending on the speed at which they allow a task to be completed. Typically, fast algorithms are usable while slow algorithms are unusable.