Stem-and-leaf plot: Difference between revisions

Stem-and-leaf plot (view source)

Revision as of 10:36, 10 February 2024

95,994 bytes added , 4 months ago

m

→‎{{header|Wren}}: Minor tidy

PureFox

9,485

edits

Revision as of 23:40, 11 December 2012 (view source) rosettacode>Gerard Schildberger (→‎{{header\|REXX}}: changed REXX program to allow for decimal fractions. -- ~~~~) ← Older edit		Revision as of 10:36, 10 February 2024 (view source) PureFox (talk \| contribs) m (→‎{{header\|Wren}}: Minor tidy) Newer edit →
(100 intermediate revisions by 40 users not shown)
Line 2: Create a well-formatted [[wp:Stem-and-leaf_plot\|stem-and-leaf plot]] from the following data set, where the leaves are the last digits: <blockquote style="font-family: monospace; white-space: pre-wrap;"~~><small~~>12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 146~~</small>~~</blockquote> ~~<!-- The data set generation parameters: humps at 0 and 80 of width 80, 60 elements, slopes 3 and 6. -->~~ <!-- The data set generation parameters: humps at 0 and 80 of width 80, 60 elements, slopes 3 and 6. --> The primary intent of this task is the presentation of information. It is acceptable to hardcode the data set or characteristics of it (such as what the stems are) in the example, insofar as it is impractical to make the example generic to any data set. For example, in a computation-less language like HTML the data set may be entirely prearranged within the example; the interesting characteristics are how the proper visual formatting is arranged. If possible, the output should not be a bitmap image. <tt>Monospaced plain text</tt> is acceptable, but do better if you can. It may be a window, i.e. not a file. '''Note:''' If you wish to try multiple data sets, you might try [[Stem-and-leaf plot/Data generator\|this generator]]. <br><br> =={{header\|11l}}== {{trans\|Kotlin}} <syntaxhighlight lang="11l">F leaf_plot(&x) x.sort() V i = x[0] I/ 10 - 1 L(j) 0 .< x.len V d = x[j] I/ 10 L d > i i++ print(‘#.#3 \|’.format((j != 0) * "\n", i), end' ‘’) print(‘ ’(x[j] % 10), end' ‘’) print() V data = [ 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105, 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58, 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43, 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118, 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122, 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114, 34, 133, 45, 120, 30, 127, 31, 116, 146 ] leaf_plot(&data)</syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|ACL2}}== <~~lang~~syntaxhighlight ~~Lisp~~lang="lisp">(defun insert (x xs) (cond ((endp xs) (list x)) ((> x (first xs)) Line 50 ⟶ 101: (reverse (stem-and-leaf-bins (reverse (isort xs)) 0 nil))))</~~lang~~syntaxhighlight> =={{header\|Action!}}== {{libheader\|Action! Tool Kit}} <syntaxhighlight lang="action!">INCLUDE "D2:SORT.ACT" ;from the Action! Tool Kit PROC Main() DEFINE len="121" BYTE ARRAY a(len)=[ 12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 146] BYTE i,j,min,max,stem,leaf Put(125) PutE() ;clear screen SortB(a,len,0) min=a(0)/10 max=a(len-1)/10 FOR i=min TO max DO IF i<10 THEN Put(' ) FI PrintB(i) Print("* \| ") FOR j=0 TO len-1 DO stem=a(j)/10 IF stem=i THEN leaf=a(j) MOD 10 PrintB(leaf) FI OD PutE() OD RETURN</syntaxhighlight> {{out}} [https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Stem-and-leaf_plot.png Screenshot from Atari 8-bit computer] <pre> 0* \| 77 1* \| 2388 2* \| 357777778899 3* \| 011112345677789 4* \| 001222233344456788 5* \| 23788 6* \| 138 7* \| 1 8* \| 9* \| 69 10* \| 4555567999 11* \| 13333444555666677778899 12* \| 00112234445556777788 13* \| 1239 14* \| 16 </pre> =={{header\|Ada}}== [[GNAT]] used for sorting, could use any other sorting method. Does not handle negative stems properly. <syntaxhighlight lang="ada"> ~~<lang Ada>~~ with Ada.Text_IO; use Ada.Text_IO; with Ada.Integer_Text_IO; use Ada.Integer_Text_IO; Line 96 ⟶ 202: end loop; end stemleaf; </syntaxhighlight> ~~</lang>~~ Output: <pre> Line 115 ⟶ 221: 14 \| 1 6 </pre> =={{header\|ALGOL 68}}== ===With sorting=== {{works with\|ALGOL 68G\|Any - tested with release 2.8.3.win32}} {{libheader\|ALGOL 68-rows}} Note the source of rows.incl.a68 is available on a page on Rosetta Code - see the link above. <br><br> Note that the wikipedia article linked to by the Task states that the stem and leaf are <i>typically</i> datum / 10 and datum MOD 10. <br> This sample can also also handle atypical cases. <syntaxhighlight lang="algol68"> BEGIN # produce a stem and leaf plot of some numbers, leaf = last digit, # # stem = leading digits # PR read "rows.incl.a68" PR # include row (array) utilities # []INT data = ( 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44 , 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139 , 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117 , 119, 58, 109, 23, 105, 63, 27, 44, 105, 99, 41 , 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121 , 58, 114, 126, 53, 114, 96, 25, 109, 7, 31, 141 , 46, 13, 27, 43, 117, 116, 27, 7, 68, 40, 31 , 115, 124, 42, 128, 52, 71, 118, 117, 38, 27, 106 , 33, 117, 116, 111, 40, 119, 47, 105, 57, 122, 109 , 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125 , 107, 114, 34, 133, 45, 120, 30, 127, 31, 116, 146 ); # generates a stem-and-leaf plot of d, the stems and leaves are derived # # 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 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 := stem( d[ LWB d ] ); 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 ] ); IF first OR curr stem /= this stem THEN curr stem +:= 1; WHILE IF NOT first THEN print( ( newline ) ) ELSE first := FALSE FI; print( ( whole( curr stem, -4 ), "\|" ) ); curr stem < this stem DO curr stem +:= 1 OD FI; print( ( " ", whole( leaf( d[ i ] ), 0 ) ) ) OD FI # stem and leaf plot # ; # sort the data # [ LWB data : UPB data ]INT sorted data := data; 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, 0, ( INT n )INT: n OVER 10, ( INT n )INT: n MOD 10 ) END </syntaxhighlight> {{out}} <pre> 0\| 7 7 1\| 2 3 8 8 2\| 3 5 7 7 7 7 7 7 8 8 9 9 3\| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4\| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5\| 2 3 7 8 8 6\| 1 3 8 7\| 1 8\| 9\| 6 9 10\| 4 5 5 5 5 6 7 9 9 9 11\| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12\| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13\| 1 2 3 9 14\| 1 6 </pre> === Without external dependencies === This solution doesn't use any library code and doesn't sort the data. {{works with\|ALGOL 68G\|Any - tested with release 2.8.3.win32}} <syntaxhighlight lang="algol68"> PROC stem and leaf plot = ([]INT data)VOID: BEGIN # get lowest and highest stem values # INT min stem := data[LWB data] % 10, max stem := data[LWB data] % 10; FOR i FROM LWB data + 1 TO UPB data DO INT stem := data[i] % 10; IF min stem > stem THEN min stem := stem FI; IF max stem < stem THEN max stem := stem FI OD; # this array will store the amount of leaves per stem: # [min stem : max stem, 0:9]INT stems; FOR i FROM LWB stems TO UPB stems DO stems[i,] := []INT((0,0,0,0,0,0,0,0,0,0))[@0] OD; # fill the array # FOR i FROM LWB data TO UPB data DO stems[data[i] % 10, data[i] %* 10] +:= 1 OD; # print the histogram # FOR i FROM LWB stems TO UPB stems DO print((whole(i, -4), "\| ")); FOR j FROM 0 TO 9 DO print(REPR (j + ABS "0") * stems[i,j]) OD; print(newline) OD END; []INT data = (12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105, 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58, 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43, 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118, 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122, 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114, 34, 133, 45, 120, 30, 127, 31, 116, 146); stem and leaf plot(data) </syntaxhighlight> {{out}} <pre> 0\| 77 1\| 2388 2\| 357777778899 3\| 011112345677789 4\| 001222233344456788 5\| 23788 6\| 138 7\| 1 8\| 9\| 69 10\| 4555567999 11\| 13333444555666677778899 12\| 00112234445556777788 13\| 1239 14\| 16 </pre> =={{header\|Arturo}}== <syntaxhighlight lang="arturo">data: [ 12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 146 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 ] tens: gather sort data => [& / 10] loop 0..do last keys tens 'n [ ns: ~"\|n\|" prints [pad ns 2 "\|"] if key? tens ns -> prints map tens\[ns] => [& % 10] print "" ]</syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6</pre> =={{header\|AutoHotkey}}== <~~lang~~syntaxhighlight ~~AutoHotkey~~lang="autohotkey">SetWorkingDir %A_ScriptDir% #NoEnv Data := "12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 146" Line 155 ⟶ 455: Return ToReturn } </syntaxhighlight> ~~</lang>~~ Output: <pre> Line 174 ⟶ 474: 14 \| 1 6 </pre> =={{header\|~~BBC BASIC~~AWK}}== <syntaxhighlight lang="awk"> # syntax: GAWK -f STEM-AND-LEAF_PLOT.AWK # # sorting: # PROCINFO["sorted_in"] is used by GAWK # SORTTYPE is used by Thompson Automation's TAWK # BEGIN { data = "12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 " \ "125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 " \ "105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 " \ "109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 " \ "38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 " \ "28 48 125 107 114 34 133 45 120 30 127 31 116 146" data_points = split(data,data_arr," ") for (i=1; i<=data_points; i++) { x = data_arr[i] stem = int(x / 10) leaf = x % 10 if (i == 1) { lo = hi = stem } lo = min(lo,stem) hi = max(hi,stem) arr[stem][leaf]++ } PROCINFO["sorted_in"] = "@ind_str_asc" ; SORTTYPE = 1 for (i=lo; i<=hi; i++) { printf("%4d \|",i) arr[i][""] for (j in arr[i]) { for (k=1; k<=arr[i][j]; k++) { printf(" %d",j) leaves_printed++ } } printf("\n") } if (data_points == leaves_printed) { exit(0) } else { printf("error: %d data points != %d leaves printed\n",data_points,leaves_printed) exit(1) } } function max(x,y) { return((x > y) ? x : y) } function min(x,y) { return((x < y) ? x : y) } </syntaxhighlight> <p>output:</p> <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|BASIC}}== ==={{header\|ANSI BASIC}}=== {{trans\|QuickBASIC}} {{works with\|Decimal BASIC}} <syntaxhighlight lang="basic"> 100 PROGRAM StemAndLeafPlot 110 OPTION BASE 0 120 DIM Dat(120) 130 FOR I = 0 TO 120 140 READ Dat(I) 150 NEXT I 160 DATA 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124 170 DATA 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123 180 DATA 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105 190 DATA 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58 200 DATA 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43 210 DATA 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118 220 DATA 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122 230 DATA 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114 240 DATA 34, 133, 45, 120, 30, 127, 31, 116, 146 250 CALL LeafPlot(Dat) 260 END 270 REM ********************** 1000 EXTERNAL SUB LeafPlot(A()) 1010 CALL ShellSort(A) 1020 LET I = INT(A(0) / 10) - 1 1030 FOR J = 0 TO UBOUND(A) 1040 LET D = INT(A(J) / 10) 1050 DO WHILE D > I 1060 LET I = I + 1 1070 IF J <> 0 THEN PRINT 1080 PRINT USING "## \|": I; 1090 LOOP 1100 PRINT USING "##": MOD(A(J), 10); 1110 NEXT J 1120 PRINT 1130 END SUB 1140 REM ******************** 2000 EXTERNAL SUB ShellSort(A()) 2010 LET N = UBOUND(A) 2020 LET Incr = INT(N / 2) 2030 DO WHILE Incr > 0 2040 FOR I = Incr TO N - 1 2050 LET J = I - Incr 2060 DO WHILE J >= 0 2070 IF A(J) > A(J + Incr) THEN 2080 REM SWAP A(J), A(J + Incr): J = J - Incr 2090 LET Tmp = A(J) 2100 LET A(J) = A(J + Incr) 2110 LET A(J + Incr) = Tmp 2120 LET J = J - Incr 2130 ELSE 2140 LET J = -1 2150 END IF 2160 LOOP 2170 NEXT I 2180 LET Incr = INT(Incr / 2) 2190 LOOP 2200 END SUB </syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> ==={{header\|ASIC}}=== {{trans\|QuickBASIC\|A global array used instead of subroutine parameters.}} <syntaxhighlight lang="basic"> REM Stem-and-leaf plot DIM A(120) DATA 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124 DATA 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123 DATA 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105 DATA 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58 DATA 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43 DATA 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118 DATA 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122 DATA 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114 DATA 34, 133, 45, 120, 30, 127, 31, 116, 146 FOR I = 0 TO 120 READ A(I) NEXT I N = 121 NMin1 = N - 1 GOSUB LeafPlot: END LeafPlot: GOSUB ShellSortInt: I = A(0) / 10 I = I - 1 FOR J = 0 TO NMin1 D = A(J) / 10 WHILE D > I I = I + 1 IF J <> 0 THEN PRINT ENDIF SI$ = STR$(I) SI$ = RIGHT$(SI$, 2) PRINT SI$; PRINT " \|"; WEND AJMod10 = A(J) MOD 10 SI$ = STR$(AJMod10) SI$ = RIGHT$(SI$, 2) PRINT SI$; NEXT J PRINT RETURN ShellSortInt: Incr = N / 2 WHILE Incr > 0 FOR I = Incr TO NMin1 J = I - Incr JPlIncr = J + Incr WHILE J >= 0 IF A(J) > A(JPlIncr) THEN Tmp = A(J) A(J) = A(JPlIncr) A(JPlIncr) = Tmp JPlIncr = J J = J - Incr ELSE J = -1 ENDIF WEND NEXT I Incr = Incr / 2 WEND RETURN </syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> ==={{header\|BBC BASIC}}=== {{works with\|BBC BASIC for Windows}} <~~lang~~syntaxhighlight lang="bbcbasic"> INSTALL @lib$+"SORTLIB" Sort% = FN_sortinit(0, 0) Line 212 ⟶ 747: NEXT PRINT ENDPROC</~~lang~~syntaxhighlight> Output: <pre> Line 230 ⟶ 765: 13 \| 1 2 3 9 14 \| 1 6 </pre> ==={{header\|FreeBASIC}}=== <syntaxhighlight lang="freebasic">' version 22-06-2015 ' compile with: fbc -s console ' for boundry checks on array's compile with: fbc -s console -exx ' from the rosetta code FreeBASIC entry #Define out_of_data 99999999 ' any number that is not in the set will do Sub shellsort(s() As Integer) ' from the FreeBASIC entry at rosetta code ' sort from lower bound to the highter bound Dim As Integer lb = LBound(s) Dim As Integer ub = UBound(s) Dim As Integer done, i, inc = ub - lb Do inc = inc / 2.2 If inc < 1 Then inc = 1 Do done = 0 For i = lb To ub - inc If s(i) > s(i + inc) Then Swap s(i), s(i + inc) done = 1 End If Next Loop Until done = 0 Loop Until inc = 1 End Sub ' ------=< TASK DATA >=------ Data 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124 Data 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123 Data 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105 Data 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58 Data 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43 Data 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118 Data 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122 Data 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114 Data 34, 133, 45, 120, 30, 127, 31, 116, 146 Data out_of_data ' ------=< MAIN >=------ Dim As String read_in Dim As Integer i, x, y, count = -1 ' to let the index start on 0 Dim As Integer d() ReDim d(300) ' big enough to hold data index start at 0 Do Read i If i = out_of_data Then Exit Do count = count + 1 d(count) = i Loop ReDim Preserve d(count) ' trim the data array shellsort(d()) ' sort data array i = 0 For y = d(0) \ 10 To d(UBound(d)) \ 10 Print Using "#### \|"; y; Do x = d(i) \ 10 ' \ = integer division If y = x Then Print Using "##"; d(i) Mod 10; i = i + 1 Else Exit Do End If Loop While i <= UBound(d) Print ' force linefeed Next ' empty keyboard buffer While Inkey <> "" : Wend Print : Print "hit any key to end program" Sleep End</syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6</pre> ==={{header\|GW-BASIC}}=== {{trans\|QuickBASIC\|A global array used instead of subroutine parameters.}} {{works with\|BASICA}} <syntaxhighlight lang="gwbasic"> 100 REM Stem-and-leaf plot 110 N% = 121: REM Array size 120 DIM A%(N% - 1) 130 FOR I% = 0 TO N% - 1 140 READ A%(I%) 150 NEXT I% 160 DATA 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124 170 DATA 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123 180 DATA 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105 190 DATA 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58 200 DATA 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43 210 DATA 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118 220 DATA 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122 230 DATA 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114 240 DATA 34, 133, 45, 120, 30, 127, 31, 116, 146 250 GOSUB 1000 260 END 990 REM Leaf plot 1000 GOSUB 2000 1010 I% = A%(0) \ 10 - 1 1020 FOR J% = 0 TO N% - 1 1030 D% = A%(J%) \ 10 1040 WHILE D% > I% 1050 I% = I% + 1 1060 IF J% THEN PRINT 1070 PRINT USING "## \|"; I%; 1080 WEND 1090 PRINT USING "##"; A%(J%) MOD 10; 1100 NEXT J% 1110 PRINT 1120 RETURN 1990 REM ** Shell sort 2000 INCR% = N% \ 2 2010 WHILE INCR% > 0 2020 FOR I% = INCR% TO N% - 1 2030 J% = I% - INCR% 2040 WHILE J% >= 0 2050 IF A%(J%) > A%(J% + INCR%) THEN SWAP A%(J%), A%(J% + INCR%): J% = J% - INCR% ELSE J% = -1 2060 WEND 2070 NEXT I% 2080 INCR% = INCR% \ 2 2090 WEND 2100 RETURN </syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> ==={{header\|PureBasic}}=== {{works with\|PureBasic\|4.41}} <syntaxhighlight lang="purebasic">If OpenConsole() Dim MyList(120) Define i, j, StemMax, StemMin Restore MyData ; Get the address of MyData, e.g. the data to print as a Stem-and-leaf plot For a=0 To 120 Read.i MyList(a) ; Read the data into the used Array If MyList(a)>StemMax StemMax=MyList(a) ; Find the largest Stem layer at the same time EndIf If MyList(a)<StemMin StemMin=MyList(a) ; Find the smallest Stem layer at the same time EndIf Next StemMax/10: StemMin/10 ; Remove the leafs from the Stem limits SortArray(MyList(),#PB_Sort_Ascending) ; Sort the data For i=StemMin To StemMax Print(RSet(Str(i),3)+" \| ") ; Print the Stem For j=0 To 120 If MyList(j)<10i ; Skip all smaller then current Continue ElseIf MyList(j)>=10(i+1) ; Break current print if a new Stem layer is reached Break Else Print(Str(MyList(j)%10)+" ") ; Print all Leafs on this current Stem layer EndIf Next j PrintN("") Next i Print(#CRLF$+#CRLF$+"Press ENTER to exit") Input() CloseConsole() EndIf DataSection MyData: Data.i 12,127, 28, 42, 39,113, 42, 18, 44,118, 44, 37,113,124, 37, 48,127, 36, 29, 31,125,139,131,115 Data.i 105,132,104,123, 35,113,122, 42,117,119, 58,109, 23,105, 63, 27, 44,105, 99, 41,128,121,116,125 Data.i 32, 61, 37,127, 29,113,121, 58,114,126, 53,114, 96, 25,109, 7, 31,141, 46, 13, 27, 43,117,116 Data.i 27, 7, 68, 40, 31,115,124, 42,128, 52, 71,118,117, 38, 27,106, 33,117,116,111, 40,119, 47,105 Data.i 57,122,109,124,115, 43,120, 43, 27, 27, 18, 28, 48,125,107,114, 34,133, 45,120, 30,127, 31,116,146 EndDataSection</syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> ==={{header\|QuickBASIC}}=== {{trans\|BBC BASIC\|But Shell sort is used.}} <syntaxhighlight lang="qbasic"> REM Stem-and-leaf plot DECLARE SUB LeafPlot (X%()) DECLARE SUB ShellSortInt (A%()) CONST MAXDATNDX = 120 DIM Dat%(MAXDATNDX) FOR I% = 0 TO MAXDATNDX READ Dat%(I%) NEXT I% DATA 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124 DATA 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123 DATA 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105 DATA 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58 DATA 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43 DATA 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118 DATA 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122 DATA 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114 DATA 34, 133, 45, 120, 30, 127, 31, 116, 146 LeafPlot Dat%() END SUB LeafPlot (X%()) ShellSortInt X%() I% = X%(0) \ 10 - 1 FOR J% = 0 TO UBOUND(X%) D% = X%(J%) \ 10 WHILE D% > I% I% = I% + 1 IF J% THEN PRINT PRINT USING "## \|"; I%; WEND PRINT USING "##"; X%(J%) MOD 10; NEXT PRINT END SUB SUB ShellSortInt (A%()) N% = UBOUND(A%) + 1 Incr% = N% \ 2 WHILE Incr% > 0 FOR I% = Incr% TO N% - 1 J% = I% - Incr% WHILE J% >= 0 IF A%(J%) > A%(J% + Incr%) THEN SWAP A%(J%), A%(J% + Incr%) J% = J% - Incr% ELSE J% = -1 END IF WEND NEXT I% Incr% = Incr% \ 2 WEND END SUB </syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> ==={{header\|uBasic/4tH}}=== <syntaxhighlight lang="text">Push 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124 Push 0, 13 : Gosub _Read ' read 1st line of data Push 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123 Push 14, 27 : Gosub _Read ' read 2nd line of data Push 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105 Push 28, 41 : Gosub _Read ' read 3rd line of data Push 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58 Push 42, 55 : Gosub _Read ' read 4tH line of data Push 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43 Push 56, 69 : Gosub _Read ' read 5th line of data Push 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118 Push 70, 83 : Gosub _Read ' read 6th line of data Push 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122 Push 84, 97 : Gosub _Read ' read 7th line of data Push 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114 Push 98, 111 : Gosub _Read ' read 8th line of data Push 34, 133, 45, 120, 30, 127, 31, 116, 146 Push 112, 120 : Gosub _Read ' read last line of data Push 121 : Gosub _SimpleSort ' now sort 121 elements i = @(0) / 10 - 1 For j = 0 To Pop() - 1 ' note array size was still on stack d = @(j) / 10 Do While d > i If j Print i = i + 1 If i < 10 Print " "; ' align stem number Print i;" \|"; ' print stem number Loop Print @(j) % 10;" "; ' print leaf number Next Print ' print final LF End ' simplest sorting algorithm _SimpleSort ' ( n -- n) For x = 0 To Tos() - 1 For y = x+1 To Tos() - 1 If @(x) > @ (y) Then ' if larger, switch elements Push @(y) @(y) = @(x) @(x) = Pop() Endif Next Next Return ' read a line of data backwards _Read ' (.. n1 n2 -- ..) For x = Pop() To Pop() Step -1 ' loop from n2 to n1 @(x) = Pop() ' get element from stack Next Return</syntaxhighlight> Output: <pre> 0 \|7 7 1 \|2 3 8 8 2 \|3 5 7 7 7 7 7 7 8 8 9 9 3 \|0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \|0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \|2 3 7 8 8 6 \|1 3 8 7 \|1 8 \| 9 \|6 9 10 \|4 5 5 5 5 6 7 9 9 9 11 \|1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \|0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \|1 2 3 9 14 \|1 6 0 OK, 0:2037 </pre> =={{header\|C}}== <~~lang~~syntaxhighlight lang="c">#include <stdio.h> #include <stdlib.h> int icmp(const void a, const void b) { return (const int)a < (const int)b ? -1 : (const int)a > (const int)b; } Line 271 ⟶ 1,197: return 0; }</~~lang~~syntaxhighlight>output<syntaxhighlight lang="text"> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 Line 285 ⟶ 1,211: 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6</~~lang~~syntaxhighlight> =={{header\|C sharp\|C#}}== <syntaxhighlight lang="csharp">using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; class Program { static void Main() { const string data = "12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 " + "125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 " + "105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 " + "114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 " + "115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 " + "105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 " + "133 45 120 30 127 31 116 146"; int[] ints = data.Split(' ').Select(int.Parse).ToArray(); StemAndLeafPlot(ints); Console.ReadKey(); } public static void StemAndLeafPlot(int[] arr) { int stemMax = arr.Max() / 10; int stemMin = arr.Min() / 10; Array.Sort(arr); for (int i = stemMin; i <= stemMax; i++) { Console.Write("{0,3} \| ", i); foreach (var t in arr) { if (t < 10 * i) continue; if (t >= 10 * (i + 1)) break; Console.Write("{0} ", t % 10); } Console.WriteLine(""); } } }</syntaxhighlight> <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6</pre> =={{header\|C++}}== <~~lang~~syntaxhighlight lang="cpp">#include <algorithm> #include <iomanip> #include <iostream> Line 331 ⟶ 1,321: std::cout << std::endl; } }</~~lang~~syntaxhighlight> Output: <pre> 0 \| 7 7 Line 348 ⟶ 1,338: 13 \| 1 2 3 9 14 \| 1 6</pre> ~~=={{header\|C sharp\|C#}}==~~ ~~<lang csharp>using System;~~ ~~using System.Linq;~~ =={{header\|Ceylon}}== ~~namespace _RC__Stem_and_leaf_plot~~ <syntaxhighlight lang="ceylon">"Run the module `thestemandleafplot`." { shared void run() { ~~internal class Program~~ { value data ="12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 ~~public static void StemAndLeafPlot(int[] matrix)~~ 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 { 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 ~~int stemMax = matrix.Max()/10;~~ 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 ~~int stemMin = matrix.Min()/10;~~ 120 30 127 31 116 146"; ~~Array.Sort(matrix);~~ value numbers = data ~~for (int i = stemMin; i<=stemMax; i++)~~ .split() { .map(parseInteger) ~~Console.Write("{0,3} \| ", i);~~ .coalesced; ~~foreach (var t in matrix)~~ { ~~if (t < 10 * i)~~ ~~continue;~~ ~~if (t >= 10 * (i + 1))~~ ~~break;~~ ~~Console.Write("{0} ", t % 10);~~ } ~~Console.WriteLine("");~~ } } value stemsToLeaves = numbers ~~private static void Main()~~ .group((Integer element) => element / 10) { .mapItems((Integer key, [Integer+] item) => item.map((Integer element) => element % 10)) ~~const string datas =~~ .mapItems((Integer key, {Integer+} item) => sort(item)); ~~"12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 "+~~ ~~"125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 "+~~ value lastStem = stemsToLeaves.keys.last else 0; ~~"105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 "+~~ for(i in 0..lastStem) { ~~"114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 "+~~ print("``formatInteger(i).padLeading(2)``\| ``" ".join(stemsToLeaves[i] else [])``"); ~~"115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 "+~~ } ~~"105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 "+~~ }</syntaxhighlight> ~~"133 45 120 30 127 31 116 146";~~ =={{header\|Clojure}}== ~~var dataMatrix = datas.Split(' ');~~ <syntaxhighlight lang="clojure">(def data ~~var intMatic = new int[dataMatrix.Length];~~ [12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 ~~for (var i = 0; i<dataMatrix.Length; ++i)~~ 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 ~~intMatic[i] = Convert.ToInt32(dataMatrix[i]);~~ 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 146 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116]) (defn calc-stem [number] ~~StemAndLeafPlot(intMatic);~~ (int (Math/floor (/ number 10)))) ~~Console.ReadKey();~~ } (defn calc-leaf [number] } (mod number 10)) ~~}</lang>~~ ~~<pre> 0 \| 7 7~~ (defn new-plant ~~1 \| 2 3 8 8~~ "Returns a leafless plant, with `size` empty branches, ~~2 \| 3 5 7 7 7 7 7 7 8 8 9 9~~ i.e. a hash-map with integer keys (from 0 to `size` inclusive) ~~3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9~~ mapped to empty vectors. ~~4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8~~ ~~5 \| 2 3 7 8 8~~ (new-plant 2) ;=> {0 [] 1 [] 2 []}" ~~6 \| 1 3 8~~ ~~7 \| 1~~[size] (let [end (inc size)] ~~8 \|~~ (->> (repeat end []) ~~9 \| 6 9~~ 10 \| 4 5 5 5 5 6 7 9(interleave 9(range 9end)) (apply hash-map)))) ~~11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9~~ ~~12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8~~ (defn sprout-leaves ~~13 \| 1 2 3 9~~ [plant [stem leaf]] ~~14 \| 1 6</pre>~~ (update plant stem conj leaf)) (defn stem-and-leaf [numbers] (let [max-stem (calc-stem (reduce max numbers)) baby-plant (new-plant max-stem) plant (->> (map (juxt calc-stem calc-leaf) numbers) (reduce sprout-leaves baby-plant) (sort))] (doseq [[stem leaves] plant] (print (format (str "%2s") stem)) (print " \| ") (println (clojure.string/join " " (sort leaves)))))) (stem-and-leaf data) </syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|D}}== <~~lang~~syntaxhighlight lang="d">import std.stdio, std.algorithm; void main() { Line 429 ⟶ 1,444: foreach (x; data) histo[x / 10] ~= x % 10; immutable loHi = data.reduce!(min, max~~)(data~~); foreach (i; loHi[0]/10 .. loHi[1]/10 + 1) writefln("%2d \| %(%d %) ", i, histo.get(i, []).sort()); }</~~lang~~syntaxhighlight> Output: <pre> 0 \| 7 7 Line 449 ⟶ 1,464: 13 \| 1 2 3 9 14 \| 1 6</pre> =={{header\|Elixir}}== {{trans\|Ruby}} {{works with\|Elixir\|1.3}} <syntaxhighlight lang="elixir">defmodule Stem_and_leaf do def plot(data, leaf_digits\\1) do multiplier = Enum.reduce(1..leaf_digits, 1, fn _,acc -> acc10 end) Enum.group_by(data, fn x -> div(x, multiplier) end) \|> Map.new(fn {k,v} -> {k, Enum.map(v, &rem(&1, multiplier)) \|> Enum.sort} end) \|> print(leaf_digits) end defp print(plot_data, leaf_digits) do {min, max} = Map.keys(plot_data) \|> Enum.min_max stem_width = length(to_charlist(max)) fmt = "~#{stem_width}w \| ~s~n" Enum.each(min..max, fn stem -> leaves = Enum.map_join(Map.get(plot_data, stem, []), " ", fn leaf -> to_string(leaf) \|> String.pad_leading(leaf_digits) end) :io.format fmt, [stem, leaves] end) end end data = ~w(12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 146) \|> Enum.map(&String.to_integer(&1)) Stem_and_leaf.plot(data)</syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|Euphoria}}== <~~lang~~syntaxhighlight lang="euphoria">include sort.e procedure leaf_plot(sequence s) Line 478 ⟶ 1,540: 114, 34, 133, 45, 120, 30, 127, 31, 116, 146 } leaf_plot(data)</~~lang~~syntaxhighlight> Output: Line 499 ⟶ 1,561: =={{header\|F Sharp\|F#}}== <~~lang~~syntaxhighlight lang="fsharp">open System let data = Line 525 ⟶ 1,587: printfn "") plotStemAndLeafs data</~~lang~~syntaxhighlight> Output: <pre> Line 543 ⟶ 1,605: 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|Factor}}== <syntaxhighlight lang="factor">USING: assocs formatting grouping.extras io kernel math prettyprint sequences sorting ; : leaf-plot ( seq -- ) natural-sort [ 10 /i ] group-by dup keys last 1 + [ dup "%2d \| " printf of [ 10 mod pprint bl ] each nl ] with each-integer ; { 12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 146 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 } leaf-plot</syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|Forth}}== <~~lang~~syntaxhighlight lang="forth">create data 12 , 127 , 28 , 42 , 39 , 113 , 42 , 18 , 44 , 118 , 44 , 37 , 113 , 124 , 37 , 48 , 127 , 36 , 29 , 31 , 125 , 139 , Line 579 ⟶ 1,679: drop ; plot</~~lang~~syntaxhighlight> Output: <pre> Line 598 ⟶ 1,698: 14 \| 1 6 </pre> =={{header\|Fortran}}== Because the fancy "structured" options such as DO-WHILE also involve the maddening idea of full evaluation of redundant parts of a compound boolean expression, attempts such as <code>WHILE (I <= N .AND. A(I) ''etc.'')</code> can fail, because the parts may be evaluated "in any order", and so the array be accessed out of bounds. So instead, a classic intersecting loop tangle. Layout is easily obtained, once the span of elements belonging to each stem value is ascertained. The output loop uses the later-form array specification of A(start:stop), but in earlier Fortran an implicit DO-loop would be in order: <code>WRITE (6,12) STEM,(ABS(MOD(A(I),CLIP)), I = I1,I2 - 1)</code> Note that the MOD function can produce unexpected values for negative numbers, and, different computer/compiler/language combinations may produce different surprises. In this case, negative values produce negative remainder values, but the ABS function suppresses the surprise. <syntaxhighlight lang="fortran"> SUBROUTINE COMBSORT(A,N) INTEGER A() !The array. INTEGER N !The count. INTEGER H,T !Assistants. LOGICAL CURSE H = N - 1 !Last - First, and not +1. 1 H = MAX(1,H10/13) !The special feature. IF (H.EQ.9 .OR. H.EQ.10) H = 11 !A twiddle. CURSE = .FALSE. !So far, so good. DO I = N - H,1,-1 !If H = 1, this is a BubbleSort. IF (A(I) .GT. A(I + H)) THEN !One compare. T=A(I); A(I)=A(I+H); A(I+H)=T !One swap. CURSE = .TRUE. !One curse. END IF !One test. END DO !One loop. IF (CURSE .OR. H.GT.1) GO TO 1 !Work remains? END SUBROUTINE COMBSORT !Good performance, small code. SUBROUTINE TOPIARY(A,N) !Produces a "stem&leaf" display for the integers in A, damaging A. INTEGER A() !An array of integers. INTEGER N !Their number. INTEGER CLIP !Semi-generalisation. PARAMETER (CLIP = 10) !Or at least, annotation. INTEGER I1,I2,STEM !Assistants. CALL COMBSORT(A,N) !Rearrange the array! STEM = A(1)/CLIP !The first stem value. I1 = 1 !The first stem's span starts here. I2 = I1 !And so far as I know, ends here. 10 I2 = I2 + 1 !Probe ahead one position. IF (I2 .GT. N) GO TO 11 !Off the end? Don't look! IF (A(I2)/CLIP .EQ.STEM) GO TO 10 !Still in the same stem? Probe on. Cast forth a STEM line, corresponding to elements I1:I2 - 1. 11 WRITE (6,12) STEM,ABS(MOD(A(I1:I2 - 1),CLIP)) !ABS: MOD with negatives can be unexpected. 12 FORMAT (I4,"\|",(100I1)) !Layout. If more than a hundred, starts a new line. IF (I2 .GT. N) RETURN !Are we there yet? I1 = I2 !No. This is my new span's start. Chug along to the next STEM value. 13 STEM = STEM + 1 !Advance to the next stem. IF (A(I2)/CLIP.GT.STEM) GO TO 11!Has the stem reached the impending value? GO TO 10 !Yes. Scan its span. END SUBROUTINE TOPIARY !The days of carefully-arranged output. PROGRAM TEST INTEGER VALUES(121) !The exact number of values. DATA VALUES/ !As in the specified example. o 12,127, 28, 42, 39,113, 42, 18, 44,118, !A regular array 1 44, 37,113,124, 37, 48,127, 36, 29, 31, !Makes counting easier. 2 125,139,131,115,105,132,104,123, 35,113, 3 122, 42,117,119, 58,109, 23,105, 63, 27, 4 44,105, 99, 41,128,121,116,125, 32, 61, 5 37,127, 29,113,121, 58,114,126, 53,114, 6 96, 25,109, 7, 31,141, 46, 13, 27, 43, 7 117,116, 27, 7, 68, 40, 31,115,124, 42, 8 128, 52, 71,118,117, 38, 27,106, 33,117, 9 116,111, 40,119, 47,105, 57,122,109,124, o 115, 43,120, 43, 27, 27, 18, 28, 48,125, 1 107,114, 34,133, 45,120, 30,127, 31,116, 2 146/ CALL TOPIARY(VALUES,121) END </syntaxhighlight> Output: (If additional spacing is desired, I2 format could be used, etc.) <pre> 0\|77 1\|2388 2\|357777778899 3\|011112345677789 4\|001222233344456788 5\|23788 6\|138 7\|1 8\| 9\|69 10\|4555567999 11\|13333444555666677778899 12\|00112234445556777788 13\|1239 14\|16 </pre> =={{header\|Go}}== <~~lang~~syntaxhighlight lang="go">package main import ( Line 639 ⟶ 1,829: } } }</~~lang~~syntaxhighlight> Output: <pre> Line 660 ⟶ 1,850: =={{header\|Haskell}}== <~~lang~~syntaxhighlight lang="haskell">import Data.List import Control.Arrow import Control.Monad Line 682 ⟶ 1,872: stems = map (flip(,)[]) $ uncurry enumFromTo $ minimum &&& maximum $ fst $ unzip stemLeaf showStemLeaves f w (a,b) = f w (show a) ++ " \|" ++ concatMap (f w. show) b fb = length $ show $ maximum $ map abs ds</~~lang~~syntaxhighlight> Output: <pre>Main> task nls Line 700 ⟶ 1,890: 13 \| 1 2 3 9 14 \| 1 6</pre> Or alternatively – aiming more for legibility than for economy or concision: <syntaxhighlight lang="haskell">import Data.List (groupBy, intersperse, mapAccumL, sortBy) import Data.Ord (comparing) import Data.Function (on) import Control.Arrow ((&&&)) -- Strings derived from integers, -- and split into [(initial string, final character)] tuples. xs :: [(String, Char)] xs = (init &&& last) . show <$> [ 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105, 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58, 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43, 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118, 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122, 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114, 34, 133, 45, 120, 30, 127, 31, 116, 146 ] -- Re-reading the initial strings as Ints -- (empty strings read as 0), ns :: [(Int, Char)] ns = (\x -> let s = fst x in ( if null s then 0 else (read s :: Int) , snd x)) <$> xs -- and sorting and grouping by these initial Ints, -- interpreting them as data-collection bins. bins :: [[(Int, Char)]] bins = groupBy (on (==) fst) (sortBy (mappend (comparing fst) (comparing snd)) ns) -- Forming bars by the ordered accumulation of final characters in each bin, bars :: [(Int, String)] bars = (fst . head &&& fmap snd) <$> bins -- and obtaining a complete series, with empty bar strings -- interpolated for any missing integers. series :: [(Int, String)] series = (concat . snd) $ mapAccumL (\a x -> let n = fst x in if a == n then (a + 1, [x]) else (n + 1, ((\i -> (i, "")) <$> [a .. (n - 1)]) ++ [x])) 1 bars -- Assembling the series as a list of strings with right-justified indices, justifyRight :: Int -> Char -> String -> String justifyRight n c s = drop (length s) (replicate n c ++ s) plotLines :: [String] plotLines = foldr (\x a -> (justifyRight 2 ' ' (show (fst x)) ++ " \| " ++ intersperse ' ' (snd x)) : a) [] series -- and passing these over to IO as a single newline-delimited string. main :: IO () main = putStrLn $ unlines plotLines </syntaxhighlight> {{Out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6</pre> =={{header\|HicEst}}== The dialog prompts for bitmap or a text image, and for the stem base. Data are read in from clipboard. <~~lang~~syntaxhighlight ~~HicEst~~lang="hicest">REAL :: workspace(1000), base=16 DLG(CHeckbox=bitmap, NameEdit=base, DNum, MIn=1, MAx=16) ! 1 <= stem base <= 16 Line 730 ⟶ 2,012: WRITE(Format="i3, ':'") stem ENDIF ENDDO</~~lang~~syntaxhighlight> Shown is the given example for bitmap=0 and base 16 <pre> 0 : 7 7 C D Line 744 ⟶ 2,026: =={{header\|Icon}} and {{header\|Unicon}}== <~~lang~~syntaxhighlight lang="unicon">procedure main(A) prune := integer(\A[1]) \| 10 # Boundary between leaf and stem every put(data := [], integer(!&input)) Line 755 ⟶ 2,037: } write() end</~~lang~~syntaxhighlight> Sample output from data. <pre>->stem <stem.data Line 782 ⟶ 2,064: =={{header\|J}}== '''Solution: (Tacit)''' <~~lang~~syntaxhighlight lang="j">stem =: <.@(%&10) leaf =: 10&\| stemleaf =: (stem@{. ; leaf)/.~ stem Line 788 ⟶ 2,070: expandLeaves=: (expandStems e. ])@[ #inv ] showStemLeaf=: (":@,.@expandStems@[ ; ":&>@expandLeaves)&>/@(>@{. ; <@{:)@\|:@stemleaf@/:~</~~lang~~syntaxhighlight> '''Solution: (Explicit)''' <~~lang~~syntaxhighlight lang="j">stemleafX=: monad define leaves=. 10 \| y stems=. y <.@:% 10 Line 803 ⟶ 2,085: xleaves=. (xstems e. stems) #inv leaves NB. expand leaves to match xstems (": ,.xstems) ; ":&> xleaves )</~~lang~~syntaxhighlight> '''Example:''' <~~lang~~syntaxhighlight lang="j"> nls =: ; <@(_&".);._2 noun define 12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 Line 844 ⟶ 2,126: (showStemLeaf -: showStemLeafX) nls NB. both solutions give same result 1</~~lang~~syntaxhighlight> =={{header\|Java}}== {{works with\|Java\|1.5+}} <~~lang~~syntaxhighlight lang="java5">import java.util.Collections; import java.util.LinkedList; import java.util.List; Line 903 ⟶ 2,186: printPlot(plot); } }</~~lang~~syntaxhighlight> {{works with\|Java\|1.8+}} <syntaxhighlight lang="java5">import java.util.Arrays; import java.util.Collection; import java.util.Collections; import java.util.LinkedList; import java.util.List; import java.util.Map; import java.util.Optional; import java.util.stream.Collectors; import java.util.stream.IntStream; public interface StemAndLeaf { public static final int[] data = {12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105, 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58, 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43, 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118, 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122, 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114, 34, 133, 45, 120, 30, 127, 31, 116, 146}; public static Map<Integer, List<Integer>> createPlot(int... data) { Map<Integer, List<Integer>> plot = Arrays.stream(data) .parallel() .boxed() .collect( Collectors.groupingBy( datum -> datum / 10, // stem, integer division Collectors.mapping( datum -> datum % 10, // leaf Collectors.toList() ) ) ) ; int highestStem = Arrays.stream(data) .parallel() .map(datum -> datum / 10) .max() .orElse(-1) //for filling in stems with no leaves ; Optional.of(plot) .map(Map::keySet) .map(Collection::size) .filter(size -> size < highestStem + 1 /highest stem value and 0/) .ifPresent(p -> IntStream.rangeClosed( 0, highestStem ) .parallel() .forEach(i -> plot.computeIfAbsent(i, $ -> new LinkedList<>()) ) ) ; return plot; } public static void printPlot(Map<Integer, List<Integer>> plot) { plot.entrySet() .stream() .parallel() .peek(line -> Optional.of(line) .map(Map.Entry::getValue) .ifPresent(Collections::sort) ) .map(line -> String.join(" ", String.valueOf(line.getKey()), "\|", String.valueOf(line.getValue()) ) ) .forEachOrdered(System.out::println) ; } public static void main(String... arguments) { Optional.of(data) .map(StemAndLeaf::createPlot) .ifPresent(StemAndLeaf::printPlot) ; } }</syntaxhighlight> Output: <pre>0 \| [7, 7] Line 920 ⟶ 2,289: 13 \| [1, 2, 3, 9] 14 \| [1, 6]</pre> =={{header\|JavaScript}}== ===JavaScript + DOM=== It turns out that HTML+CSS renders the plot quite attractively. <~~lang~~syntaxhighlight lang="html4strict"><!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"> <head> <meta http-equiv="Content-Type" content="text/html;charset=utf-8" > Line 999 ⟶ 2,370: </body> </html></~~lang~~syntaxhighlight> The output looks like: [[File:Stemplot.png]] ===JavaScript ES6=== <syntaxhighlight lang="javascript">(() => { // main :: IO String const main = () => { // Strings derived from integers, // and split into [(initial string, final character)] tuples. // xs :: [(String, Char)] const xs = map(n => fanArrow(init, last)(n.toString()), [ 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105, 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58, 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43, 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118, 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122, 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114, 34, 133, 45, 120, 30, 127, 31, 116, 146 ]); // Re-reading the initial strings as Ints // (empty strings read as 0), // ns :: [(Int, Char)] const ns = map(x => { const s = fst(x); return Tuple(s.length > 0 ? ( parseInt(s, 10) ) : 0, snd(x)); }, xs); // and sorting and grouping by these initial Ints, // interpreting them as data-collection bins. // bins :: [[(Int, Char)]] const bins = groupBy( (a, b) => a[0] === b[0], sortBy(mappendComparing([ [fst, true], [snd, true] ]), ns) ); // Forming bars by the ordered accumulation of // final characters in each bin, // bars :: [(Int, String)] const bars = map( fanArrow( x => fst(x[0]), x => map(snd, x) ), bins ); // and obtaining a complete series, with empty bars // interpolated for any missing integers. // series :: [(Int, String)] const series = concat(mapAccumL( (a, x) => { const n = x[0]; return a !== n ? ( Tuple(1 + n, map(i => Tuple(i, []), enumFromToInt(a, n - 1) ) .concat([x]) ) ) : Tuple(1 + a, [x]); }, 7, bars )[1]); // Assembling the series as a list of strings with // right-justified indices, // plotLines :: [String] const plotLines = foldr( (x, a) => cons(concat([ justifyRight(2, ' ', x[0].toString()), ' \| ', unwords(x[1]) ]), a), [], series ); // and passing these over to IO as a single // newline-delimited string. return unlines(plotLines); }; // GENERIC FUNCTIONS ----------------------------------------------------- // Tuple (,) :: a -> b -> (a, b) const Tuple = (a, b) => ({ type: 'Tuple', '0': a, '1': b }); // compare :: a -> a -> Ordering const compare = (a, b) => a < b ? -1 : (a > b ? 1 : 0); // concat :: [[a]] -> [a] // concat :: [String] -> String const concat = xs => xs.length > 0 ? (() => { const unit = typeof xs[0] === 'string' ? '' : []; return unit.concat.apply(unit, xs); })() : []; // cons :: a -> [a] -> [a] const cons = (x, xs) => [x, ...xs]; // enumFromToInt :: Int -> Int -> [Int] const enumFromToInt = (m, n) => n >= m ? Array.from({ length: Math.floor(n - m) + 1 }, (_, i) => m + i) : []; // Compose a function from a simple value to a tuple of // the separate outputs of two different functions // fanArrow (&&&) :: (a -> b) -> (a -> c) -> (a -> (b, c)) const fanArrow = (f, g) => x => Tuple(f(x), g(x)); // flip :: (a -> b -> c) -> b -> a -> c const flip = f => (a, b) => f.apply(null, [b, a]); // Note that that the Haskell signature of foldr is different from that of // foldl - the positions of accumulator and current value are reversed // foldr :: (a -> b -> b) -> b -> [a] -> b const foldr = (f, a, xs) => xs.reduceRight(flip(f), a); // fst :: (a, b) -> a const fst = tpl => tpl.type !== 'Tuple' ? undefined : tpl[0]; // Typical usage: groupBy(on(eq, f), xs) // groupBy :: (a -> a -> Bool) -> [a] -> [[a]] const groupBy = (f, xs) => { const dct = xs.slice(1) .reduce((a, x) => { const h = a.active.length > 0 ? a.active[0] : undefined; return h !== undefined && f(h, x) ? { active: a.active.concat([x]), sofar: a.sofar } : { active: [x], sofar: a.sofar.concat([a.active]) }; }, { active: xs.length > 0 ? [xs[0]] : [], sofar: [] }); return dct.sofar.concat(dct.active.length > 0 ? [dct.active] : []); }; // init :: [a] -> [a] const init = xs => xs.length > 0 ? xs.slice(0, -1) : undefined; // justifyRight :: Int -> Char -> String -> String const justifyRight = (n, cFiller, strText) => n > strText.length ? ( (cFiller.repeat(n) + strText) .slice(-n) ) : strText; // last :: [a] -> a const last = xs => xs.length ? xs.slice(-1)[0] : undefined; // map :: (a -> b) -> [a] -> [b] const map = (f, xs) => xs.map(f); // mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y]) const mapAccumL = (f, acc, xs) => xs.reduce((a, x, i) => { const pair = f(a[0], x, i); return Tuple(pair[0], a[1].concat(pair[1])); }, Tuple(acc, [])); // mappendComparing :: [((a -> b), Bool)] -> (a -> a -> Ordering) const mappendComparing = fboolPairs => (x, y) => fboolPairs.reduce( (ordr, fb) => { const f = fb[0]; return ordr !== 0 ? ( ordr ) : fb[1] ? ( compare(f(x), f(y)) ) : compare(f(y), f(x)); }, 0 ); // snd :: (a, b) -> b const snd = tpl => tpl.type !== 'Tuple' ? undefined : tpl[1]; // sortBy :: (a -> a -> Ordering) -> [a] -> [a] const sortBy = (f, xs) => xs.slice() .sort(f); // unlines :: [String] -> String const unlines = xs => xs.join('\n'); // unwords :: [String] -> String const unwords = xs => xs.join(' '); // MAIN ------------------------------------------------------------------ return main(); })();</syntaxhighlight> {{Out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6</pre> =={{header\|jq}}== <syntaxhighlight lang="jq">def stem_and_leaf: # align-right: def right: tostring \| (4-length) " " + .; sort \| .[0] as $min \| .[length-1] as $max \| "\($min/10\|floor\|right) \| " as $stem \| reduce .[] as $d # state: [ stem, string ] ( [ 0, $stem ]; .[0] as $stem \| if ($d/10) \| floor == $stem then [ $stem, (.[1] + "\($d % 10)" )] else [ $stem + 1, (.[1] + "\n\($stem+1\|right) \| \($d % 10)" )] end ) \| .[1] ;</syntaxhighlight> '''Example''': <syntaxhighlight lang="jq">def data: [ 12,127,28,42,39,113, 42,18,44,118,44,37,113,124,37,48,127,36,29,31, 125,139,131,115,105,132,104,123,35,113,122,42,117,119,58,109,23,105, 63,27,44,105,99,41,128,121,116,125,32,61,37,127,29,113,121,58,114,126, 53,114,96,25,109,7,31,141,46,13,27,43,117,116,27,7,68,40,31,115,124,42, 128,52,71,118,117,38,27,106,33,117,116,111,40,119,47,105,57,122,109, 124,115,43,120,43,27,27,18,28,48,125,107,114,34,133,45,120, 30,127, 31,116,146 ]; data \| stem_and_leaf </syntaxhighlight> {{Out}} <syntaxhighlight lang="sh"> $ jq -n -r -f stem-and-leaf_plot.jq 0 \| 77 1 \| 2388 2 \| 357777778899 3 \| 011112345677789 4 \| 001222233344456788 5 \| 23788 6 \| 138 7 \| 1 8 \| 6 9 \| 9 10 \| 4555567999 11 \| 13333444555666677778899 12 \| 00112234445556777788 13 \| 1239 14 \| 16</syntaxhighlight> =={{header\|Julia}}== '''The Function''' This is a rather elaborate function that creates a string depicting a stem and leaf plot. Much of the elaboration is to handle the case of negative numbers that have a stem of 0. There is also a bit of work to allow for leaf sizes other than 1 (some power of 10). <syntaxhighlight lang="julia"> function stemleaf{T<:Real}(a::Array{T,1}, leafsize=1) ls = 10^int(log10(leafsize)) (stem, leaf) = divrem(sort(int(a/ls)), 10) leaf[sign(stem) .== -1] = -1 negzero = leaf .< 0 if any(negzero) leaf[negzero] = -1 nz = @sprintf "%10s \| " "-0" nz = join(map(string, leaf[negzero]), " ") nz = "\n" stem = stem[!negzero] leaf = leaf[!negzero] else nz = "" end slp = "" for i in stem[1]:stem[end] i != 0 \|\| (slp = nz) slp = @sprintf "%10d \| " i slp = join(map(string, leaf[stem .== i]), " ") slp = "\n" end slp = " Leaf Unit = " string(convert(T, ls)) * "\n" return slp end </syntaxhighlight> '''Main''' <syntaxhighlight lang="julia"> println("Using the Task's Test Data") test = """12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 146""" test = map(parseint, split(test, r"\s")) println(stemleaf(test)) println("Test with Reals and Negative Zero Stem") test = [-23.678758, -12.45, -3.4, 4.43, 5.5, 5.678, 16.87, 24.7, 56.8] println(stemleaf(test)) println("Test with Leaf Size Scaling") test = int(500randn(20)) println("Using: ", test) println(stemleaf(test, 10)) </syntaxhighlight> {{out}} <pre> Using the Task's Test Data 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 Leaf Unit = 1 Test with Reals and Negative Zero Stem -2 \| 4 -1 \| 2 -0 \| 3 0 \| 4 6 6 1 \| 7 2 \| 5 3 \| 4 \| 5 \| 7 Leaf Unit = 1.0 Test with Leaf Size Scaling Using: [318,1163,-35,-611,-436,-127,-374,-150,119,541,-670,-558,3,592,604,1181,-180,419,829,-364] -6 \| 7 1 -5 \| 6 -4 \| 4 -3 \| 7 6 -2 \| -1 \| 8 5 3 -0 \| 4 0 \| 0 1 \| 2 2 \| 3 \| 2 4 \| 2 5 \| 4 9 6 \| 0 7 \| 8 \| 3 9 \| 10 \| 11 \| 6 8 Leaf Unit = 10 </pre> =={{header\|Kotlin}}== {{trans\|C}} <syntaxhighlight lang="scala">// version 1.1.2 fun leafPlot(x: IntArray) { x.sort() var i = x[0] / 10 - 1 for (j in 0 until x.size) { val d = x[j] / 10 while (d > i) print("%s%3d \|".format(if (j != 0) "\n" else "", ++i)) print(" ${x[j] % 10}") } println() } fun main(args: Array<String>) { val data = intArrayOf( 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105, 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58, 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43, 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118, 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122, 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114, 34, 133, 45, 120, 30, 127, 31, 116, 146 ) leafPlot(data) }</syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|Lua}}== <~~lang~~syntaxhighlight lang="lua">data = { 12,127,28,42,39,113, 42,18,44,118,44,37,113,124,37,48,127,36,29,31, 125,139,131,115,105,132,104,123,35,113,122,42,117,119,58,109,23,105, 63,27,44,105,99,41,128,121,116,125,32,61,37,127,29,113,121,58,114,126, Line 1,028 ⟶ 2,840: print "" end</~~lang~~syntaxhighlight> Output: <pre> 0 \| 7 7 Line 1,046 ⟶ 2,858: 14 \| 1 6</pre> =={{header\|~~Mathematica~~Maple}}== <syntaxhighlight lang="maple">StemPlot := proc( datatable::{rtable,list,algebraic} ) ~~<lang Mathematica>len[n_] := RealDigits[n][[2]]; padding = len[Max@ Quotient[inputdata, 10]];~~ local i, j, k, tf, LeafStemTable, LeafStemIndices; k:=0; LeafStemTable := ListTools:-Categorize( (x,y) -> iquo(x, 10) = iquo(y, 10), sort(datatable)); if LeafStemTable = NULL then error "Empty List"; elif nops( [ LeafStemTable ] ) = 1 or not( type( LeafStemTable[2], list) ) then LeafStemTable := [ LeafStemTable ]; end if; LeafStemIndices := { seq( iquo( LeafStemTable[i][1], 10 ), i = 1..nops( [ LeafStemTable ] ) ) }; for i from min( LeafStemIndices ) to max( LeafStemIndices ) do if i in LeafStemIndices then k := k + 1; if i = 0 then if min( datatable ) >=0 then printf( "%-4a%s%-s\n", i, " \| ", StringTools:-Remove( "[],", convert( [seq( abs( irem( LeafStemTable[k][j], 10 ) ), j = 1..nops( LeafStemTable[k] ) )], string ) ) ); else tf := ListTools:-Occurrences( true, (x->type(x,negative))~(LeafStemTable[k])); printf( "%s%-4a%s%-s\n", "-", i, " \| ", StringTools:-Remove( "[],", convert( [seq( abs( irem( LeafStemTable[k][j], 10 ) ), j = 1 .. tf )], string ) ) ); printf( "%-4a%s%-s\n", i, " \| ", StringTools:-Remove( "[],", convert( [seq( abs( irem( LeafStemTable[k][j], 10 ) ), j = tf + 1 .. nops( LeafStemTable[k] ) )], string ) ) ); end if; else printf( "%-4a%s%-s\n", i, " \| ", StringTools:-Remove( "[],", convert( [seq( abs( irem( LeafStemTable[k][j], 10 ) ), j = 1..nops( LeafStemTable[k] ) )], string ) ) ); end if; else printf( "%-4a%s\n", i, " \| " ); end if; end do; return NULL; end proc: Y := [ 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105, 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58, 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43, 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118, 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122, 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114, 34, 133, 45, 120, 30, 127, 31, 116, 146]; StemPlot(Y);</syntaxhighlight> <pre>0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6</pre> =={{header\|Mathematica}}/{{header\|Wolfram Language}}== <syntaxhighlight lang="mathematica">len[n_] := RealDigits[n][[2]]; padding = len[Max@ Quotient[inputdata, 10]]; For[i = Min@ Quotient[inputdata, 10],i <= Max@ Quotient[inputdata, 10], i++, (Print[i, If[(padding - len[i]) > 0, (padding - len[i])" " <> " \|", " \|"] , StringJoin[(" " <> #) & /@ Map[ToString, #]]])&@ Select[{Quotient[#, 10], Mod[#, 10]} & /@ Sort[inputdata],Part[#, 1] == i &][[;; , 2]]]</~~lang~~syntaxhighlight> {{out}} <pre>0 \| 7 7 1 \| 2 3 8 8 Line 1,072 ⟶ 2,950: =={{header\|MATLAB}} / {{header\|Octave}}== <~~lang~~syntaxhighlight ~~Matlab~~lang="matlab">function stem_and_leaf_plot(x,stem_unit,leaf_unit) if nargin < 2, stem_unit = 10; end; if nargin < 3, Line 1,094 ⟶ 2,972: x = [12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 146]; stem_and_leaf_plot(x); </~~lang~~syntaxhighlight> Output: <pre> Line 1,117 ⟶ 2,995: =={{header\|Maxima}}== <~~lang~~syntaxhighlight lang="maxima">load(descrptive)$ data: [12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, Line 1,141 ⟶ 3,019: 12\|00112234445556777788 13\|1239 14\|16</~~lang~~syntaxhighlight> =={{header\|Nim}}== <syntaxhighlight lang="nim">import tables import math import strutils import algorithm type StemLeafPlot = ref object leafDigits: int multiplier: int plot: TableRef[int, seq[int]] proc `$`(s: seq[int]): string = result = "" for item in s: result &= $item & " " proc `$`(self: StemLeafPlot): string = result = "" var keys: seq[int] = @[] for stem, _ in self.plot: keys.add(stem) for printedStem in keys.min..keys.max: result &= align($printedStem & " \| ", ($keys.max).len + 4) if printedStem in keys: self.plot[printedStem].sort(system.cmp[int]) result &= $self.plot[printedStem] result &= "\n" proc parse(self: StemLeafPlot, value: int): tuple[stem, leaf: int] = (value div self.multiplier, abs(value mod self.multiplier)) proc init[T](self: StemLeafPlot, leafDigits: int, data: openArray[T]) = self.leafDigits = leafDigits self.multiplier = 10 ^ leafDigits self.plot = newTable[int, seq[int]]() for value in data: let (stem, leaf) = self.parse(value) if stem notin self.plot: self.plot[stem] = @[leaf] else: self.plot[stem].add(leaf) var taskData = @[12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105, 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58, 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43, 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118, 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122, 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114, 34, 133, 45, 120, 30, 127, 31, 116, 146] var negativeData = @[-24, -12, -3, 4, 6, 6, 17, 25, 57] echo "Using the Task's Test Data" var taskPlot = StemLeafPlot() taskPlot.init(1, taskData) echo taskPlot echo "Test with Negative Stem" var negativePlot = StemLeafPlot() negativePlot.init(1, negativeData) echo negativePlot</syntaxhighlight> {{out}} <pre>Using the Task's Test Data 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 Test with Reals and Negative Zero Stem -2 \| 4 -1 \| 2 0 \| 3 4 6 6 1 \| 7 2 \| 5 3 \| 4 \| 5 \| 7</pre> =={{header\|OCaml}}== Line 1,147 ⟶ 3,118: The definition of the function <code>unique</code> below can be omited if one uses the [http://code.google.com/p/ocaml-extlib/ extlib]. <~~lang~~syntaxhighlight lang="ocaml">let unique li = let rec aux acc = function \| [] -> (List.rev acc) Line 1,155 ⟶ 3,126: else aux (x::acc) xs in aux [] li</~~lang~~syntaxhighlight> <~~lang~~syntaxhighlight lang="ocaml">let data = [ 12; 127; 28; 42; 39; 113; 42; 18; 44; 118; 44; 37; 113; 124; 37; 48; 127; 36; 29; 31; 125; 139; 131; 115; 105; 132; 104; 123; 35; 113; 122; Line 1,168 ⟶ 3,139: let data = List.map (fun d -> (d / 10, d mod 10)) data ~~let a = d / 10 in~~ ~~let b = d mod 10 in~~ ~~(a, b)~~ ~~) data~~ let keys = Line 1,184 ⟶ 3,151: List.iter (Printf.printf " %d") vs; print_newline() ) keys</~~lang~~syntaxhighlight> we can output the same latex code than the Perl example replacing the main function as follow: <~~lang~~syntaxhighlight lang="ocaml">let () = print_endline "\ \\documentclass{report} Line 1,205 ⟶ 3,172: print_endline "\ \\end{tabular} \\end{document}"</~~lang~~syntaxhighlight> =={{header\|Perl}}== <syntaxhighlight lang="perl">my @data = sort {$a <=> $b} qw( 12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 ); my $columns = @data; my $laststem = undef; for my $value (@data) { my $stem = int($value / 10); my $leaf = $value % 10; while (not defined $laststem or $stem > $laststem) { if (not defined $laststem) { $laststem = $stem - 1; } else { print " \n"; } $laststem++; printf "%3d \|", $laststem; } print " $leaf"; } </syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1</pre> === LaTeX output === ~~=={{header\|Perl}} generating {{header\|LaTeX}}==~~ generating {{header\|LaTeX}} ~~<lang perl>#!/usr/bin/perl -w~~ <syntaxhighlight lang="perl">#!/usr/bin/perl -w my @data = sort {$a <=> $b} qw( 12 127 28 42 39 113 42 18 44 118 44 Line 1,250 ⟶ 3,262: \end{tabular} \end{document} EOT</~~lang~~syntaxhighlight> LaTeX output of the Perl program: <~~lang~~syntaxhighlight lang="latex">\documentclass{report} \usepackage{fullpage} \begin{document} Line 1,265 ⟶ 3,277: 14 & 1 \end{tabular} \end{document}</~~lang~~syntaxhighlight> The parameter to the <code>tabular</code> environment defines the columns of the table. “r” and “c” are right- and center-aligned columns, “\|” is a vertical rule, and “<code>{''count''}{''cols''}”</code> repeats a column definition ''count'' times. Line 1,275 ⟶ 3,287: and the output will be in <code>plot.pdf</code>. [http://switchb.org/kpreid/2009/12-24-rc-stemplot-perl-latex-output Output.] =={{header\|~~Perl 6~~Phix}}== {{trans\|~~Perl~~Euphoria}} <!--<syntaxhighlight lang="phix">(phixonline)--> <span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span> ~~Handles negative stems properly.~~ <span style="color: #008080;">procedure</span> <span style="color: #000000;">leaf_plot</span><span style="color: #0000FF;">(</span><span style="color: #004080;">sequence</span> <span style="color: #000000;">s</span><span style="color: #0000FF;">)</span> ~~<lang perl6>my @data = <~~ <span style="color: #000000;">s</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">sort</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">deep_copy</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s</span><span style="color: #0000FF;">))</span> ~~12 127 28 42 39 113 42 18 44 118 44~~ <span style="color: #004080;">sequence</span> <span style="color: #000000;">stem</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">repeat</span><span style="color: #0000FF;">({},</span><span style="color: #7060A8;">floor</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s</span><span style="color: #0000FF;">[$]/</span><span style="color: #000000;">10</span><span style="color: #0000FF;">)+</span><span style="color: #000000;">1</span><span style="color: #0000FF;">)</span> ~~37 113 124 37 48 127 36 29 31 125 139~~ <span style="color: #008080;">for</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">do</span> ~~131 115 105 132 104 123 35 113 122 42 117~~ <span style="color: #004080;">integer</span> <span style="color: #000000;">j</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">floor</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">]/</span><span style="color: #000000;">10</span><span style="color: #0000FF;">)+</span><span style="color: #000000;">1</span> ~~119 58 109 23 105 63 27 44 105 99 41~~ <span style="color: #000000;">stem</span><span style="color: #0000FF;">[</span><span style="color: #000000;">j</span><span style="color: #0000FF;">]</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">deep_copy</span><span style="color: #0000FF;">(</span><span style="color: #000000;">stem</span><span style="color: #0000FF;">[</span><span style="color: #000000;">j</span><span style="color: #0000FF;">])</span> <span style="color: #0000FF;">&</span> <span style="color: #7060A8;">remainder</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">],</span><span style="color: #000000;">10</span><span style="color: #0000FF;">)</span> ~~128 121 116 125 32 61 37 127 29 113 121~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> ~~58 114 126 53 114 96 25 109 7 31 141~~ <span style="color: #008080;">for</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">stem</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">do</span> ~~46 13 27 43 117 116 27 7 68 40 31~~ <span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span> <span style="color: #008000;">"%3d \| "</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">-</span><span style="color: #000000;">1</span><span style="color: #0000FF;">)</span> ~~115 124 42 128 52 71 118 117 38 27 106~~ <span style="color: #008080;">for</span> <span style="color: #000000;">j</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">stem</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">])</span> <span style="color: #008080;">do</span> ~~33 117 116 111 40 119 47 105 57 122 109~~ <span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span> <span style="color: #008000;">"%d "</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">stem</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">][</span><span style="color: #000000;">j</span><span style="color: #0000FF;">])</span> ~~124 115 43 120 43 27 27 18 28 48 125~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> ~~107 114 34 133 45 120 30 127 31 116 146~~ <span style="color: #7060A8;">puts</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">'\n'</span><span style="color: #0000FF;">)</span> ~~>».Int.sort;~~ <span style="color: #008080;">end</span> <span style="color: #008080;">for</span> <span style="color: #008080;">end</span> <span style="color: #008080;">procedure</span> ~~my Int $stem_unit = 10;~~ ~~my %h = @data.classify: div $stem_unit;~~ <span style="color: #008080;">constant</span> <span style="color: #000000;">data</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{</span> <span style="color: #000000;">12</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">127</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">28</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">42</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">39</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">113</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">42</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">18</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">44</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">118</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">44</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">37</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">113</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">124</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">37</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">48</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">127</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">36</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">29</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">31</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">125</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">139</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">131</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">115</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">105</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">132</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">104</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">123</span><span style="color: #0000FF;">,</span> ~~my $range = [minmax] %h.keys».Int;~~ <span style="color: #000000;">35</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">113</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">122</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">42</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">117</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">119</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">58</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">109</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">23</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">105</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">63</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">27</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">44</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">105</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">99</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">41</span><span style="color: #0000FF;">,</span> ~~my $stem_format = "%{$range.from.chars max $range.to.chars}d";~~ <span style="color: #000000;">128</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">121</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">116</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">125</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">32</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">61</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">37</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">127</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">29</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">113</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">121</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">58</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">114</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">126</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">53</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">114</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">96</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">25</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">109</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">7</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">31</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">141</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">46</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">13</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">27</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">43</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">117</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">116</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">27</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">7</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">68</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">40</span><span style="color: #0000FF;">,</span> ~~for $range.list -> $stem {~~ <span style="color: #000000;">31</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">115</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">124</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">42</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">128</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">52</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">71</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">118</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">117</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">38</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">27</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">106</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">33</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">117</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">116</span><span style="color: #0000FF;">,</span> ~~my $leafs = %h{$stem} // [];~~ <span style="color: #000000;">111</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">40</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">119</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">47</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">105</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">57</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">122</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">109</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">124</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">115</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">43</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">120</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">43</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">27</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">27</span><span style="color: #0000FF;">,</span> ~~say $stem.fmt($stem_format), ' \| ', ~$leafs.map: * % $stem_unit;~~ <span style="color: #000000;">18</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">28</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">48</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">125</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">107</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">114</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">34</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">133</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">45</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">120</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">30</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">127</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">31</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">116</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">146</span> <span style="color: #0000FF;">}</span> ~~}</lang>~~ <span style="color: #000000;">leaf_plot</span><span style="color: #0000FF;">(</span><span style="color: #000000;">data</span><span style="color: #0000FF;">)</span> ~~Output:<pre> 0 \| 7 7~~ <!--</syntaxhighlight>--> ~~1 \| 2 3 8 8~~ {{out}} ~~2 \| 3 5 7 7 7 7 7 7 8 8 9 9~~ <pre style="font-size: 8px"> ~~3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9~~ 0 \| 7 7 ~~4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8~~ 5 1 \| 2 3 7 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 ~~6 \| 1 3 8~~ 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 ~~7 \| 1~~ 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 ~~8 \|~~ 9 5 \| 62 3 7 8 98 10 ~~\| 4 5 5 5 5~~ 6 7\| 91 93 98 7 \| 1 ~~11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9~~ 8 \| ~~12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8~~ 13 \| 19 2\| 36 9 10 \| 4 5 5 5 5 6 7 9 9 9 ~~14 \| 1 6</pre>~~ 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|PicoLisp}}== <~~lang~~syntaxhighlight ~~PicoLisp~~lang="picolisp">(de Data 12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 Line 1,339 ⟶ 3,356: (sort Data) ) ) (for I (range (caar L) (car (last L))) (prinl (align 3 I) " \| " (glue " " (cdr (assoc I L)))) ) )</~~lang~~syntaxhighlight> Output: <pre> 0 \| 7 7 Line 1,357 ⟶ 3,374: 14 \| 1 6</pre> =={{header\|~~PureBasic~~PowerShell}}== <syntaxhighlight lang="powershell"> ~~{{works with\|PureBasic\|4.41}}~~ $Set = -split '12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 146' ~~'''PureBasic Code'''~~ ~~<lang PureBasic>If OpenConsole()~~ ~~Dim MyList(120)~~ ~~Define i, j, StemMax, StemMin~~ ~~Restore MyData ; Get the address of MyData, e.g. the data to print as a Stem-and-leaf plot~~ ~~For a=0 To 120~~ ~~Read.i MyList(a) ; Read the data into the used Array~~ ~~If MyList(a)>StemMax~~ ~~StemMax=MyList(a) ; Find the largest Stem layer at the same time~~ ~~EndIf~~ ~~If MyList(a)<StemMin~~ ~~StemMin=MyList(a) ; Find the smallest Stem layer at the same time~~ ~~EndIf~~ ~~Next~~ ~~StemMax/10: StemMin/10 ; Remove the leafs from the Stem limits~~ ~~SortArray(MyList(),#PB_Sort_Ascending) ; Sort the data~~ $Data = $Set \| Select @{ Label = 'Stem'; Expression = { [string][int]$_.Substring( 0, $_.Length - 1 ) } }, @{ Label = 'Leaf'; Expression = { [string]$_[-1] } } ~~For i=StemMin To StemMax~~ ~~Print(RSet(Str(i),3)+" \| ") ; Print the Stem~~ ~~For j=0 To 120~~ ~~If MyList(j)<10i ; Skip all smaller then current~~ ~~Continue~~ ~~ElseIf MyList(j)>=10(i+1) ; Break current print if a new Stem layer is reached~~ ~~Break~~ ~~Else~~ ~~Print(Str(MyList(j)%10)+" ") ; Print all Leafs on this current Stem layer~~ ~~EndIf~~ ~~Next j~~ ~~PrintN("")~~ ~~Next i~~ $StemStats = $Data \| Measure-Object -Property Stem -Minimum -Maximum ~~Print(#CRLF$+#CRLF$+"Press ENTER to exit")~~ ~~Input()~~ ~~CloseConsole()~~ ~~EndIf~~ ForEach ( $Stem in $StemStats.Minimum..$StemStats.Maximum ) ~~DataSection~~ { ~~MyData:~~ @( $Stem.ToString().PadLeft( 2, " " ), '\|' ) + ( ( $Data \| Where Stem -eq $Stem ).Leaf \| Sort ) -join " " ~~Data.i 12,127, 28, 42, 39,113, 42, 18, 44,118, 44, 37,113,124, 37, 48,127, 36, 29, 31,125,139,131,115~~ } ~~Data.i 105,132,104,123, 35,113,122, 42,117,119, 58,109, 23,105, 63, 27, 44,105, 99, 41,128,121,116,125~~ </syntaxhighlight> ~~Data.i 32, 61, 37,127, 29,113,121, 58,114,126, 53,114, 96, 25,109, 7, 31,141, 46, 13, 27, 43,117,116~~ {{out}} ~~Data.i 27, 7, 68, 40, 31,115,124, 42,128, 52, 71,118,117, 38, 27,106, 33,117,116,111, 40,119, 47,105~~ <pre> ~~Data.i 57,122,109,124,115, 43,120, 43, 27, 27, 18, 28, 48,125,107,114, 34,133, 45,120, 30,127, 31,116,146~~ 0 \| 7 7 ~~EndDataSection</lang>~~ 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 ~~'''Output'''~~ 3 \| 0 \|1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 \|2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 \| 3 ~~5 7 7 7 7 7~~ 7 8 8 ~~9 9~~ 3 6 \| 0 1 ~~1 1 1 2~~ 3 ~~4 5 6 7 7 7~~ 8 9 7 \| 1 ~~4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8~~ 8 \| ~~5 \| 2 3 7 8 8~~ 9 \| 6 ~~\| 1 3 8~~9 10 \| 4 5 5 5 5 6 7 \|9 9 19 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 ~~8 \|~~ 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 ~~9 \| 6 9~~ 1013 \| 41 52 ~~5 5 5 6 7 9 9~~3 9 14 \| 1 6 ~~11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9~~ </pre> ~~12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8~~ ~~13 \| 1 2 3 9~~ ~~14 \| 1 6~~ =={{header\|Python}}== Adjusting <code>Stem.leafdigits</code> allows you to modify how many digits of a value are used in the leaf, with the stem intervals adjusted accordingly. <~~lang~~syntaxhighlight lang="python">from collections import namedtuple from pprint import pprint as pp from math import floor Line 1,464 ⟶ 3,447: if __name__ == '__main__': print( stemplot(data0) )</~~lang~~syntaxhighlight> '''Sample Output''' Line 1,489 ⟶ 3,472: Here is an another example using an OrderedDict and Counter <~~lang~~syntaxhighlight lang="python">from collections import OrderedDict, Counter x= [12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, Line 1,508 ⟶ 3,491: stemleaf(x) </syntaxhighlight> ~~</lang>~~ Output : Line 1,528 ⟶ 3,511: 14 \| 1 6 </pre> Or, generalising a little to write a purely declarative function (in terms of '''groupby''' and '''reduce''') which takes stem and leaf accessor functions as its first arguments: <syntaxhighlight lang="python">from itertools import (groupby) from functools import (reduce) # stemLeaf :: (String -> Int) -> (String -> String) -> String -> String def stemLeaf(f, g, s): return '\n'.join(map( lambda x: str(x[0]).rjust(2) + ' \| ' + reduce(lambda a, tpl: a + tpl[1] + ' ', x[1], ''), (groupby(sorted( map(lambda x: (f(x), g(x)), s.split()) ), lambda x: x[0] )) )) # main :: IO() def main(): def stem(s): return (lambda x=s[:-1]: int(x) if 0 < len(x) else 0)() def leaf(s): return s[-1] s = ('12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31' ' 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23' ' 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58' ' 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40' ' 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47' ' 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133' ' 45 120 30 127 31 116 146') print (stemLeaf(stem, leaf, s)) main()</syntaxhighlight> <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|Quackery}}== <syntaxhighlight lang="Quackery"> [ sort -1 swap witheach [ 2dup < iff [ cr dip [ 10 + dup 10 / dup 10 < if sp echo say " \| " ] ] again [ over - 9 + echo sp ] ] drop ] is leafplot ( [ --> ) ' [ 12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 146 ] leafplot</syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|R}}== <syntaxhighlight lang="r"> ~~<lang R>~~ x <- c(12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117, 119, 58, 109, Line 1,540 ⟶ 3,625: stem(x) </syntaxhighlight> ~~</lang>~~ Output : Line 1,561 ⟶ 3,646: 14 \| 16 </pre> =={{header\|Racket}}== <syntaxhighlight lang="racket"> #lang racket (define (show-stem+leaf data) (define xs (sort data <)) (for ([stem (add1 (floor (/ (last xs) 10)))]) (printf "~a\|" (~a #:width 2 #:align 'right stem)) (for ([i xs]) (define-values [q r] (quotient/remainder i 10)) (when (= q stem) (printf " ~a" r))) (newline))) (show-stem+leaf (sequence->list (in-producer read eof))) </syntaxhighlight> Sample run: <pre> $ racket sl.rkt < the-data 0\| 7 7 1\| 2 3 8 8 2\| 3 5 7 7 7 7 7 7 8 8 9 9 3\| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4\| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5\| 2 3 7 8 8 6\| 1 3 8 7\| 1 8\| 9\| 6 9 10\| 4 5 5 5 5 6 7 9 9 9 11\| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12\| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13\| 1 2 3 9 14\| 1 6 </pre> =={{header\|Raku}}== (formerly Perl 6) {{trans\|Perl}} Handles negative stems properly. <syntaxhighlight lang="raku" line>my @data = < 12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 146 >».Int.sort; my Int $stem_unit = 10; my %h = @data.classify: * div $stem_unit; my $range = [minmax] %h.keys».Int; my $stem_format = "%{$range.min.chars max $range.max.chars}d"; for $range.list -> $stem { my $leafs = %h{$stem} // []; say $stem.fmt($stem_format), ' \| ', ~$leafs.map: * % $stem_unit; }</syntaxhighlight> Output:<pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6</pre> =={{header\|REXX}}== ===zero and positive numbers=== ~~No checks are made to see if the numbers in the data are valid numbers (negatives and decimal fractions are allowed).~~ A check is performed to verify that all input is numeric (decimal fractions are allowed as well as exponential format). ~~<br>Also, all numbers that are processed are normalized.~~ ~~<lang rexx>/REXX program displays a stem-and-leaf plot of real numbers [-, 0, +]./~~ Also, a check is made if any of the numbers are negative (and an error message is issued).   Negative numbers are handled by the 2<sup>nd</sup> REXX version. ~~min= /This program handles negatives /~~ ~~max= /* ··· and decimal fractions. /~~ Also, all numbers that are processed are normalized.   Using a   ''sparse array''   bypasses the need for sorting. ~~parse arg data; if data='' then data=, /Not specified? Then use default/~~ <syntaxhighlight lang="rexx">/REXX program displays a stem and leaf plot of any non-negative numbers [can include 0]/ ~~12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125,~~ parse arg @ / [↓] Not specified? Then use default/ ~~139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27,~~ if @='' then @=12 44127 ~~105~~28 9942 4139 ~~128~~113 ~~121~~42 ~~116~~18 ~~125~~44 32118 6144 37 ~~127~~113 29124 ~~113~~37 ~~121~~48 58127 ~~114~~36 ~~126~~29 5331 125 ~~114~~139, 131 115 96105 25132 ~~109~~104 7123 3135 ~~141~~113 46122 1342 27117 43119 ~~117~~58 ~~116~~109 2723 7105 6863 4027 3144 ~~115~~105 ~~124~~99 4241 128 52121, 116 125 71 ~~118~~32 ~~117~~ 3861 2737 ~~106~~127 3329 ~~117~~113 ~~116~~121 ~~111~~58 40114 ~~119~~126 4753 ~~105~~114 5796 ~~122~~25 109 ~~124~~7 ~~115~~31 141 46 13 27 43 117, 116 4327 ~~120~~7 4368 2740 2731 18115 28124 4842 ~~125~~128 ~~107~~52 ~~114~~71 34118 ~~133~~117 4538 ~~120~~27 30106 ~~127~~33 31117 116 ~~146~~111 40 119 47 105, 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 146 ~~#.=~~ #.=; bot=.; top=. / [↑] define all #. elements as null./ ~~do j=1 for words(data); _=format(word(data,j),,0)/1 /normalize/~~ ~~stem~~do j=~~left~~1 for words(_,@); ~~max~~ y=word(1@, ~~length(_)-1)~~j) /~~extract~~◄─── ~~the~~process ~~stem~~each ~~from~~number in the ~~num~~list. / if ~~length~~\datatype(_y,"N")~~==1~~ then ~~stem=0~~do; say 'error* item' j "isn't ~~/handle~~numeric:" ~~single-digit~~y; ~~leaves.~~ exit; /end if ~~min==''~~y<0 then ~~min=stem~~do; say '*error* ~~if max=='~~item' j "is ~~then~~negative:" y; exit; ~~max=stem~~end n=format(y, , 0) / 1 /normalize the numbers (not malformed)/ ~~min=min(min, stemsign(_)); max=max(max, stemsign(_))~~ ~~leaf~~stem=~~right~~word(_left(n, length(n) -1) 0, 1) /~~pick~~obtain ~~off~~stem ~~the~~(1st ~~leaf~~digits) from ~~the num~~number./ ~~#.stem.leaf=#.stem.leaf~~parse var n '' -1 leaf; _=stem * sign(n) /~~construct~~ a ~~sorted~~ ~~stem-&-~~" leaf. (last digit) " " / if bot==. then do; bot=_; top=_; end /handle the first case for TOP and BOT/ bot=min(bot, _); top=max(top, _) /obtain the minimum and maximum so far/ #.stem.leaf= #.stem.leaf leaf /construct sorted stem-and-leaf entry./ end /j/ w=max(length(min), length(max) ) + 1 /~~width~~W: used to ~~align~~right justify the ~~stems~~output./ /* [↓] display the stem-and-leaf plot./ do k=bot to top; $= /$: is the output string, a plot line/ do m=0 for 10; $=$ #.k.m /build a line for the stem─&─leaf plot/ end /m/ say right(k, w) '║' space($) /display a line of stem─and─leaf plot./ end /k/ /stick a fork in it, we're all done. /</syntaxhighlight> '''output'''   when using the (internal) defaults as input: <pre> 0 ║ 7 7 1 ║ 2 3 8 8 2 ║ 3 5 7 7 7 7 7 7 8 8 9 9 3 ║ 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 ║ 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 ║ 2 3 7 8 8 6 ║ 1 3 8 7 ║ 1 8 ║ 9 ║ 6 9 10 ║ 4 5 5 5 5 6 7 9 9 9 11 ║ 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 ║ 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 ║ 1 2 3 9 14 ║ 1 6 </pre> ===negative, zero, and positive numbers=== This REXX version also handles negative numbers. <syntaxhighlight lang="rexx">/REXX program displays a stem─and─leaf plot of any real numbers [can be: neg, 0, pos]./ parse arg @ /obtain optional arguments from the CL/ if @='' then @='15 14 3 2 1 0 -1 -2 -3 -14 -15' /Not specified? Then use the default./ #.=; bot=.; top=.; z=. / [↑] define all #. elements as null./ do j=1 for words(@); y=word(@, j) /◄─── process each number in the list./ if \datatype(y,"N") then do; say 'error* item' j "isn't numeric:" y; exit; end n=format(y,,0)/1; an=abs(n); s=sign(n) /normalize the numbers (not malformed)/ stem=left(an, length(an) -1) if stem=='' then if s>=0 then stem=0 /handle case of one-digit positive #. / else stem='-0' /* " " " " " negative " / else stem=s stem /* " " " a multi-digit number./ parse var n '' -1 leaf /obtain the leaf (the last digit) of #/ if bot==. then do; bot=stem; top=bot; end /handle the first case for TOP and BOT/ bot=min(bot, stem); top=max(top, stem) /obtain the minimum and maximum so far/ if stem=='-0' then z=0 /use Z as a flag to show negative 0./ #.stem.leaf= #.stem.leaf leaf /construct sorted stem-and-leaf entry./ end /j/ w=max(length(min), length(max) ) + 1 /W: used to right─justify the output./ !='-0' / [↓] display the stem-and-leaf plot./ do k=bot to top; $= /$: is the output string, a plot line/ if k==z then do /handle a special case for negative 0./ do s=0 for 10; $=$ #.!.s /build a line for the stem─&─leaf plot/ end /s/ / [↑] address special case of -zero./ say right(!, w) '║' space($) /display a line of stem─and─leaf plot./ end / [↑] handles special case of -zero./ $= /a new plot line (of output). / do m=0 for 10; $=$ #.k.m /build a line for the stem─&─leaf plot/ end /m/ say right(k, w) '║' space($) /display a line of stem─and─leaf plot./ end /k/ /stick a fork in it, we're all done. /</syntaxhighlight> '''output'''   when using the (internal) defaults as input: <pre> -1 ║ 4 5 -0 ║ 1 2 3 0 ║ 0 1 2 3 1 ║ 4 5 </pre> =={{header\|Ring}}== <syntaxhighlight lang="ring"> # Project : Stem-and-leaf plot data = list(120) data = [12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105, 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58, 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43, 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118, 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122, 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114, 34, 133, 45, 120, 30, 127, 31, 116, 146] leafplot(data, len(data)) func leafplot(x,n) c = n x = sort(x) i = floor(x[1] / 10 ) - 1 for j = 1 to n d = floor(x[j] / 10) while d > i i = i + 1 if j > 0 see nl ok see "" + i + " \|" end see "" + (x[j] % 10) + " " next see nl </syntaxhighlight> Output: <pre> 0 \|7 7 ~~do k=min to max; _=; do m=0 for 10; _=_ #.k.m; end /m/~~ 1 \|2 3 8 8 ~~say right(k,w) '│' space(_)~~ 2 \|3 5 7 7 7 7 7 7 8 8 9 9 ~~end /k/~~ 3 \|0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 ~~/stick a fork in it, we're done./</lang>~~ 4 \|0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 ~~'''output''' when using the input of: <tt> xxx </tt>~~ 5 \|2 3 7 8 8 ~~<pre style="overflow:scroll">~~ 06 │\|1 73 8 7 7 \|1 ~~1 │ 2 3 8 8~~ 8 \| ~~2 │ 3 5 7 7 7 7 7 7 8 8 9 9~~ 9 \|6 9 ~~3 │ 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9~~ ~~4 │ 0 0 1 2 2 2 2 3 3 3~~10 \|4 45 45 5 5 6 7 89 9 9 8 11 \|1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 ~~5 │ 2 3 7 8 8~~ 12 \|0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 ~~6 │ 1 3 8~~ 13 \|1 2 3 9 ~~7 │ 1~~ 14 \|1 6 ~~8 │~~ ~~9 │ 6 9~~ ~~10 │ 4 5 5 5 5 6 7 9 9 9~~ ~~11 │ 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9~~ ~~12 │ 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8~~ ~~13 │ 1 2 3 9~~ ~~14 │ 1 6~~ </pre> =={{header\|Ruby}}== This implementation will handle negative values. <~~lang~~syntaxhighlight lang="ruby">class StemLeafPlot def initialize(data, options = {}) opts = {:leaf_digits => 1}.merge(options) Line 1,725 ⟶ 3,989: 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 146</~~lang~~syntaxhighlight> {{out}} ~~outputs~~ <pre> ~~0 \| 7 7~~ 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 Line 1,746 ⟶ 4,011: leaf unit: 1 stem unit: 10</pre> '''Simple version''' <syntaxhighlight lang="ruby">class StemLeafPlot def initialize(data, leaf_digits=1) @leaf_digits = leaf_digits multiplier = 10 * @leaf_digits @plot = data.sort.group_by{\|x\| x / multiplier} @plot.default = [] @plot.each{\|k,v\| @plot[k] = v.map{\|val\| val % multiplier}} end def print min, max = @plot.keys.minmax stem_width = max.to_s.size (min..max).each do \|stem\| leaves = @plot[stem].inject("") {\|str,leaf\| str << "%0d " % [@leaf_digits, leaf]} puts "%s \| %s" % [stem_width, stem, leaves] end end end data = DATA.read.split.map {\|s\| Integer(s)} StemLeafPlot.new(data).print __END__ 12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 146</syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|Scala}}== {{works with\|Scala\|2.8}} <~~lang~~syntaxhighlight lang="scala">def stemAndLeaf(numbers: List[Int]) = { val lineFormat = "%" + (numbers map (_.toString.length) max) + "d \| %s" val map = numbers groupBy (_ / 10) Line 1,755 ⟶ 4,069: println(lineFormat format (stem, map.getOrElse(stem, Nil) map (_ % 10) sortBy identity mkString " ")) } }</~~lang~~syntaxhighlight> Example: Line 1,791 ⟶ 4,105: =={{header\|Seed7}}== <~~lang~~syntaxhighlight lang="seed7">$ include "seed7_05.s7i"; const proc: leafPlot (in var array integer: x) is func Line 1,827 ⟶ 4,141: begin leafPlot(data); end func;</~~lang~~syntaxhighlight> Output: Line 1,847 ⟶ 4,161: 14 \| 1 6 </pre> =={{header\|Sidef}}== {{trans\|Raku}} <syntaxhighlight lang="ruby">var data = %i( 12 127 28 42 39 113 42 18 44 118 44 37 113 124 37 48 127 36 29 31 125 139 131 115 105 132 104 123 35 113 122 42 117 119 58 109 23 105 63 27 44 105 99 41 128 121 116 125 32 61 37 127 29 113 121 58 114 126 53 114 96 25 109 7 31 141 46 13 27 43 117 116 27 7 68 40 31 115 124 42 128 52 71 118 117 38 27 106 33 117 116 111 40 119 47 105 57 122 109 124 115 43 120 43 27 27 18 28 48 125 107 114 34 133 45 120 30 127 31 116 146 ).sort; var stem_unit = 10; var h = data.group_by { \|i\| i / stem_unit -> int } var rng = RangeNum(h.keys.map{.to_i}.minmax); var stem_format = "%#{rng.min.len.max(rng.max.len)}d"; rng.each { \|stem\| var leafs = (h{stem} \\ []) say(stem_format % stem, ' \| ', leafs.map { _ % stem_unit }.join(' ')) }</syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|Stata}}== <syntaxhighlight lang="stata">. clear all . input x 12 127 28 ... 31 116 146 end . stem x Stem-and-leaf plot for x 0* \| 77 1* \| 2388 2* \| 357777778899 3* \| 011112345677789 4* \| 001222233344456788 5* \| 23788 6* \| 138 7* \| 1 8* \| 9* \| 69 10* \| 4555567999 11* \| 13333444555666677778899 12* \| 00112234445556777788 13* \| 1239 14* \| 16</syntaxhighlight> =={{header\|Tcl}}== {{works with\|Tcl\|8.5}} <~~lang~~syntaxhighlight lang="tcl">package require Tcl 8.5 # How to process a single value, adding it to the table mapping stems to Line 1,909 ⟶ 4,301: 48 125 107 114 34 133 45 120 30 127 31 116 146 } printStemLeaf $data</~~lang~~syntaxhighlight> Output: <pre> Line 1,930 ⟶ 4,322: =={{header\|TUSCRIPT}}== <~~lang~~syntaxhighlight lang="tuscript"> $$ MODE TUSCRIPT digits=* Line 1,960 ⟶ 4,352: ENDLOOP DO format </syntaxhighlight> ~~</lang>~~ Output: <pre style='height:30ex;overflow:scroll'> Line 1,981 ⟶ 4,373: =={{header\|Ursala}}== <~~lang~~syntaxhighlight ~~Ursala~~lang="ursala">#import std #import nat Line 2,002 ⟶ 4,394: #show+ main = stemleaf_plot data</~~lang~~syntaxhighlight> Reading from right to left on the bottom line of the <code>stemleaf_plot</code> function, we obtain the quotient and remainder of every datum divided by ten, partition by Line 2,034 ⟶ 4,426: 14 \| 1 6 </pre> =={{header\|Wren}}== {{trans\|Kotlin}} {{libheader\|Wren-fmt}} <syntaxhighlight lang="wren">import "./fmt" for Fmt var leafPlot = Fn.new { \|x\| x.sort() var i = (x[0]/10).floor - 1 for (j in 0...x.count) { var d = (x[j] / 10).floor while (d > i) { i = i + 1 Fmt.write("$0s$3d \|", (j != 0) ? "\n" : "", i) } System.write(" %(x[j] % 10)") } System.print() } var data = [ 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105, 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58, 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43, 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118, 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122, 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114, 34, 133, 45, 120, 30, 127, 31, 116, 146 ] leafPlot.call(data)</syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|XPL0}}== {{trans\|QuickBASIC}} {{works with\|EXPL-32}} <syntaxhighlight lang="xpl0"> \ Stem-and-leaf plot code Rem=2, CrLf=9, Text=12; code real RlOut=48, Float=49, Format=52; define DataSize = 121; integer Data; procedure ShellSortInt(A, N); integer A, N; integer I, J, Incr, Tmp; begin Incr:= N / 2; while Incr > 0 do begin for I:= Incr, N - 1 do begin J:= I - Incr; while J >= 0 do begin if A(J) > A(J + Incr) then begin Tmp:= A(J); A(J):= A(J + Incr); A(J + Incr):= Tmp; J:= J - Incr end else J:= -1 end; end; Incr:= Incr / 2 end; end; procedure LeafPlot (X, N); integer X, N; integer D, I, J; begin ShellSortInt(X, N); I:= X(0) / 10 - 1; Format(2,0); for J:= 0, N - 1 do begin D:= X(J) / 10; while D > I do begin I:= I + 1; if J then CrLf(0); RlOut(0, Float(I)); Text(0, " \|"); end; RlOut(0, Float(Rem(X(J) / 10))); end; CrLf(0); end; begin Data:= [ 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105, 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58, 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43, 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118, 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122, 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114, 34, 133, 45, 120, 30, 127, 31, 116, 146]; LeafPlot(Data, DataSize) end; </syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> =={{header\|zkl}}== {{trans\|C}} <syntaxhighlight lang="zkl">fcn leaf_plot(xs){ xs=xs.sort(); i := xs[0] / 10 - 1; foreach j in (xs.len()){ d := xs[j] / 10; while (d > i){ print("%s%3d \|".fmt(j and "\n" or "", i+=1)); } print(" %d".fmt(xs[j] % 10)); } println(); } data := T( 12, 127, 28, 42, 39, 113, 42, 18, 44, 118, 44, 37, 113, 124, 37, 48, 127, 36, 29, 31, 125, 139, 131, 115, 105, 132, 104, 123, 35, 113, 122, 42, 117, 119, 58, 109, 23, 105, 63, 27, 44, 105, 99, 41, 128, 121, 116, 125, 32, 61, 37, 127, 29, 113, 121, 58, 114, 126, 53, 114, 96, 25, 109, 7, 31, 141, 46, 13, 27, 43, 117, 116, 27, 7, 68, 40, 31, 115, 124, 42, 128, 52, 71, 118, 117, 38, 27, 106, 33, 117, 116, 111, 40, 119, 47, 105, 57, 122, 109, 124, 115, 43, 120, 43, 27, 27, 18, 28, 48, 125, 107, 114, 34, 133, 45, 120, 30, 127, 31, 116, 146 ); leaf_plot(data);</syntaxhighlight> {{out}} <pre> 0 \| 7 7 1 \| 2 3 8 8 2 \| 3 5 7 7 7 7 7 7 8 8 9 9 3 \| 0 1 1 1 1 2 3 4 5 6 7 7 7 8 9 4 \| 0 0 1 2 2 2 2 3 3 3 4 4 4 5 6 7 8 8 5 \| 2 3 7 8 8 6 \| 1 3 8 7 \| 1 8 \| 9 \| 6 9 10 \| 4 5 5 5 5 6 7 9 9 9 11 \| 1 3 3 3 3 4 4 4 5 5 5 6 6 6 6 7 7 7 7 8 8 9 9 12 \| 0 0 1 1 2 2 3 4 4 4 5 5 5 6 7 7 7 7 8 8 13 \| 1 2 3 9 14 \| 1 6 </pre> {{omit from\|GUISS}}