Skip to Main Content
Computational Thinking for the Modern Problem Solver
book

Computational Thinking for the Modern Problem Solver

by David Riley, Kenny A. Hunt
March 2014
Beginner to intermediate content levelBeginner to intermediate
405 pages
12h 16m
English
Chapman and Hall/CRC
Content preview from Computational Thinking for the Modern Problem Solver
Solving Problems   ◾     113  
As an example of decomposing data, we examine two search algorithms.
A search algorithm is a method for examining a group of data items in
order to nd an item with some particular property.
e most intuitive of all search algorithms is linear search. A linear
search requires that the group of items be arranged one aer another
from rst to last. e algorithm consists of examining the rst item, then
the second, the third, the fourth, and so on, until the desired item has
been found.
As an example of a linear search, suppose you were given a stack of
award certicates and told that one of the awards might be awarded to
you. A linear search would proceed as follows looking for your certicate
in a stack of 500
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

From Computing to Computational Thinking

From Computing to Computational Thinking

Paul S. Wang

Publisher Resources

ISBN: 9781466587793