This strand covers a library of fundamental algorithms that form the toolkit of a computer scientist. It includes algorithms for sorting data (e.g., Bubble, Merge, Quick sort), searching for data (e.g., Linear, Binary search), securing data (e.g., symmetric and asymmetric encryption), and finding routes in networks (e.g., Dijkstra's algorithm). Understanding these standard solutions prevents "reinventing the wheel" and provides a basis for comparing and evaluating different approaches to a problem.