× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.



From: Leif Svalgaard <leif@leif.org>

> From: Harry Williams <planesmart@teleteam.com>
> > It was, I thought. I am dissecting all the comments now.
> > You said you would create the table with a program? How?
> >
>
> 1) sort the codes
> 2) append zeroes to each until 12 bits long
> 3) convert result to binary number
> 4) emit table entries changing the value
> when the index passes the converted binary number
> (and then look at the next binary number).
>

maybe I can be clearer:
3) convert result to binary number for each code
and store that number in an array(n) for code
number n
4) emit table entries with index i varying from array(n-1)
to array(n)-1   (suitable caution at the beginning) as
TABLE(i) = i
(assuming your 300 numbers are consecutive).





As an Amazon Associate we earn from qualifying purchases.

This thread ...

Follow-Ups:
Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.