Embedding algorithmic thinking into 1st year undergraduate programmes

We describe the embedding of algorithms and algorithmic thinking into a first-year undergraduate pure mathematics course at the London School of Economics (LSE). Responding to growing demand for computational thinking skills, we redesigned ‘Introduction to Abstract Mathematics’ to integrate algorithmic approaches throughout the curriculum rather than as an isolated topic. Using the Knowledge, Skills and Behaviours (KSBs) framework adapted from degree apprenticeships, we developed learning outcomes that distinguish knowing algorithms from thinking algorithmically. Our approach reformulates traditional proofs using constructive and algorithmic methods, introduces loop invariants alongside mathematical induction, and shows how algorithms can both prove mathematical statements and have their own properties proven.

Authors

Institutions

Publication Details

Journal
MSOR Connections
Published
2026-10-26
DOI
https://doi.org/10.21100/msor.v24i3.1686
Primary Topic
Teaching and Learning Programming
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Embedding algorithmic thinking into 1st year undergraduate programmes

David O’Sullivan
MSOR Connections
Teaching and Learning Programming
article

Embedding algorithmic thinking into 1st year undergraduate programmes

David O’Sullivan
article en

Abstract

We describe the embedding of algorithms and algorithmic thinking into a first-year undergraduate pure mathematics course at the London School of Economics (LSE). Responding to growing demand for computational thinking skills, we redesigned ‘Introduction to Abstract Mathematics’ to integrate algorithmic approaches throughout the curriculum rather than as an isolated topic. Using the Knowledge, Skills and Behaviours (KSBs) framework adapted from degree apprenticeships, we developed learning outcomes that distinguish knowing algorithms from thinking algorithmically. Our approach reformulates traditional proofs using constructive and algorithmic methods, introduces loop invariants alongside mathematical induction, and shows how algorithms can both prove mathematical statements and have their own properties proven.

MSOR ConnectionsVol. 24(3)
London School of Economics and Political Science (GB)
Openalex Percentile: Top 7%
Teaching and Learning Programming
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon