Khan Academy: The Euclidean Algorithm

Discusses how to measure the efficiency of an algorithm.

The use of formal reasoning to determine if an algorithm is correct.

Practice verifying whether algorithms are correct with empirical analysis and logical reasoning, in this set of free practice questions designed for AP Computer Science Principles students.

This video [1:32] explains how we can use de Casteljau's algorithm to calculate curves using any number of points.

Introduction to Euclid, Euclid's Elements, and Euclidean geometry. [8:23]

Practice using the building blocks of algorithms (sequencing, insertion, and selection), in this set of free practice questions designed for AP Computer Science Principles students.

Learners are invited to express algorithms in their everyday life, sports, games and apps.

Challenge question: can you work out the equations for n-degree curves generated by de Casteljau's algorithm?

Challenge question: can you work out the equations for n-degree curves generated by de Casteljau's algorithm?

An analysis of the breadth-first search algorithm and its uses is presented.