Review week 43: algorithms

This week the stack got proper data structures. For review:

• Lookup table: precompute values, store them with poke. Index = (reading − offset) / step, floor, clamp.
• Interpolation: the integer part selects the neighbours, the remainder is the fraction. lerp limits the fraction to 0 to 1.
• Sorting: bubble sort compares neighbours and swaps through two registers. n · (n − 1) / 2 comparisons – expensive.
• Searching: linear, with early exit. Minimum and maximum in one pass, the position with a comparison of its own.
• Statistics: mean, range, standard deviation in two passes. Outliers: more than 2 σ from the mean, with sgt.
• Data logger: ring buffer with mod, tick counter for the interval, no NaN into the buffer.

You pass from 60 %.