Next: Sorting Lists, Up: Prepare the Data for Display in a Graph [Contents][Index]

Based on what we have done before, we can readily foresee that it should not be too hard to write a function that CDRs down the lengths’ list, looks at each element, determines which length range it is in, and increments a counter for that range.

However, before beginning to write such a function, we should consider the advantages of sorting the lengths’ list first, so the numbers are ordered from smallest to largest. First, sorting will make it easier to count the numbers in each range, since two adjacent numbers will either be in the same length range or in adjacent ranges. Second, by inspecting a sorted list, we can discover the highest and lowest number, and thereby determine the largest and smallest length range that we will need.