<div dir="ltr"><div>Not more efficient, but perhaps more readable:</div><div> </div><div>(define (repeater f count)</div><div> (for ([x (in-range count)])</div><div> (f)))</div><div> </div></div><div class="gmail_extra"> <div class="gmail_quote">On Mon, Sep 15, 2014 at 12:50 PM, George Rudolph <<a href="mailto:rudolphg1@citadel.edu" target="_blank">rudolphg1@citadel.edu</a>> wrote: <blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"> <div bgcolor="white" background="cid:image001.gif@01CFD0EA.E54C9600" lang="EN-US" link="#9D454F" vlink="#814E95"> <img src="cid:image001.gif@01CFD0EA.E54C9600" width="0" height="0" style="width:0;min-height:0"> <div> All, I am sure this question has been answered before, but I can’t find it. Suppose I want to call some function, either built-in or user-defined, n number of times, and measure the total time it takes. Is there a more efficient or elegant way of doing this than passing the expression to a tail-recursive counting loop such as the following? (define (repeater sexpr count) (sexpr) (cond [(> count 0) (repeater sexpr (- count 1)) ]) ) George Rudolph Associate Professor of Computer Science Department of Mathematics and Computer Science 225 Thompson Hall The Citadel 171 Moultrie Street Charleston, SC 29409 <a href="tel:843.953.5032" value="+18439535032" target="_blank">843.953.5032</a> </div> </div> ____________________ Racket Users list: <a href="http://lists.racket-lang.org/users" target="_blank">http://lists.racket-lang.org/users</a> </blockquote></div> </div>