Khan Academy: Analysis of Breadth First Search

Statistics come front and center in this unit all about analyzing discrete data. Real-world situations yield data sets that the class then uses to tease out connections and conclusions. Beginning with the basic histogram and...

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

How to find the running time in binary search is explained.

Compute how many steps binary search would take to find an item in arrays of various sizes.

An analysis of Selection Sort is given in this article.

An analysis of Merge Sort is given in this article.

An analysis of Insertion Sort and its relationship to running times.

The second video on Benford's Law from the Khan Academy. This video connects Benford's Law to the logarithmic scale in an effort to explain why it holds true, particularly in data that grows exponentially. [6:27]

In this video lesson students look at a set of data, transfer the data into a two-way table and then use that table to make inferences about the data.

The resource from Khan Academy provides practice questions for the SAT. Watch Sal work through a harder Center, spread, and shape of distributions problem.