Stem-and-leaf plot: Difference between revisions

Line 242:

);

# generates a stem-and-leaf plot of d, the stems and leaves are derived #

# from the elements by stem and leaf. f ~~stem~~ if ~~the~~ first stem ~~value~~ #

# from the elements by stem and leaf. the plot starts at first stem. #

# the data is assumed to be sorted into stem then leaf order #

PROC stem and leaf plot = ( []INT d, INT f stem, PROC(INT)INT stem, leaf )VOID:

PROC stem and leaf plot = ( []INT d, INT first stem, PROC(INT)INT stem, leaf )VOID:

IF UPB d < LWB d THEN

print( ( "No data", newline ) )

ELSE

# there is some data to plot #

INT curr stem := f stem;

INT curr stem := stem( d[ LWB d ] );

~~BOOL~~ first ~~:= TRUE;~~

IF first stem < curr stem THEN

curr stem := first stem

FI;

curr stem -:= 1;

BOOL first := TRUE;

FOR i FROM LWB d TO UPB d DO

INT this stem = stem( d[ i ] );

~~INT~~ ~~this leaf~~ = ~~leaf( d[ i ]~~ );

IF first OR curr stem /= this stem THEN

curr stem +:= 1;

Line 267:

Line 270:

OD

FI;

print( ( " ", whole( ~~this~~ leaf, 0 ) ) )

print( ( " ", whole( leaf( d[ i ] ), 0 ) ) )

OD

FI # stem and leaf plot # ;

Line 275:

Line 278:

QUICKSORT sorted data FROMELEMENT LWB sorted data TOELEMENT UPB sorted data;

# plot the data: stem = element / 10, leaf = element MOD 10 #

stem and leaf plot( sorted data, -1, ( INT n )INT: n OVER 10, ( INT n )INT: n MOD 10 )

stem and leaf plot( sorted data, 0, ( INT n )INT: n OVER 10, ( INT n )INT: n MOD 10 )

END