Complexity of computer algorithms (Q1104750)

This is an introductory text merging together some well known algorithms (Horner's rule for calculating polynomials, the fast Fourier transform, bubble sort, mergesort), with empirical evaluation of their complexity and various basic programming facts like the internal computer representation of numbers and characters. The intended reader is probably a noncomputer scientist mathematician, but the paper appeals little to such a person since the deepest things are not but merely touched.