Jump to ContentJump to Main Navigation
Poems That Solve PuzzlesThe History and Science of Algorithms$
Users without a subscription are not able to see the full content.

Chris Bleakley

Print publication date: 2020

Print ISBN-13: 9780198853732

Published to Oxford Scholarship Online: October 2020

DOI: 10.1093/oso/9780198853732.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 24 January 2021

Introduction

Introduction

Chapter:
(p.1) Introduction
Source:
Poems That Solve Puzzles
Author(s):

Chris Bleakley

Publisher:
Oxford University Press
DOI:10.1093/oso/9780198853732.003.0014

The Introduction explains what an algorithms is, provides three examples, and exposes the relationship between algorithms and computers. An algorithm is a sequence of well-defined steps which solve an information problem. The chapter begins with the simple example of an algorithm for sharing sweets. The chapter highlights the elegance of effective algorithms and shows how they are written down. It then moves on to explain a straight-forward algorithm for sorting books. An alternative algorithm for more quickly sorting books is presented and contrasted. By definition, a computer is a machine that performs algorithms. The chapter explains how algorithms are the underlying methods that computers follow to process data and make decisions.

Keywords:   algorithm, sorting, computer, program, hardware, software

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .