✳flâneur — a map of the web's best reading

CSC 151 - Decomposition

eikmeier.sites.grinnell.edu · 1,732 words · saved by 1 readers

As we learned in a previous reading, an algorithm is a step-by-step procedure for solving a problem. These problems vary in scope from simple one-off tasks to complicated, generalized tasks that form the core of large, complex systems. For example, consider the problem of going through a web page and finding the links it contains. It turns out that a web page is plain text in a format known as hypertext markup language (HTML), so we can search the web page source file for occurrences of the text <a href="...">...</a> which correspond to links. For example, the beginning of this paragraph is rendered with the following HTML: The paragraph contains one link corresponding to the text yesterday's reading. We will eventually learn how to do operations like this in Scheme, but even though we can’t write a program to do this yet, we can imagine that with proper library support that this is a simple task. In contrast, the task of scraping web pages for links forms the basis of the algorithms t

CSC 151 - Decomposition Decomposition Due Wednesday, 17 September 2025 --> Summary We discuss one of the fundamental problem solving techniques in computing: algorithmic decomposition As we learned in a previous reading , an algorithm is a step-by-step procedure for solving a problem. These problems vary in scope from simple one-off tasks to complicated, generalized tasks that form the core of large, complex systems. For example, consider the problem of going through a web page and finding the links it contains. It turns out that a web page is plain text in a format known as hypertext markup l

Explore this link on the map →

saved by

related reading