I was wondering if there was any speed difference between n = BITRSHIFT(n,1) and n = n/2. I ran this:
LOCAL k As Integer, s As Double k = 8E9 s = SECONDS() DO WHILE k > 1 k = k / 2 ENDDO ? SECONDS() - s k = 8E9 s = SECONDS() DO WHILE k > 1 k = BITRSHIFT(k,1) ENDDO ? SECONDS() - s The first loop executed in 16 ms, the second displayed 0. In another bit of code, I replaced division by 2 with right shift 1 and somehow created an infinite loop. Laurie --- StripMime Report -- processed MIME parts --- multipart/alternative text/plain (text body -- kept) text/html --- _______________________________________________ Post Messages to: [email protected] Subscription Maintenance: http://mail.leafe.com/mailman/listinfo/profox OT-free version of this list: http://mail.leafe.com/mailman/listinfo/profoxtech Searchable Archive: http://leafe.com/archives/search/profox This message: http://leafe.com/archives/byMID/profox/camvtr9fj0md19tkcti-dmtg-vbeuv_ymu7ry88bqoe1r5rl...@mail.gmail.com ** All postings, unless explicitly stated otherwise, are the opinions of the author, and do not constitute legal or medical advice. This statement is added to the messages for those lawyers who are too stupid to see the obvious.
