the1's WebLog

Solutions to the Phraser programming challenge

On 3/29/04 I posted a programming challenge: given a telephone number, find all possible ways to represent it using English words and digits.

 

Several people have submitted their solutions.  This page contains a list of all the entries I received, in the order of submission.  It will be updated as I receive more solutions.

 

  1. From Calvin Hsia, unoptimized version in Fox Pro.  (My comments)
  2. From Justin Rogers, in C#.  (My comments)
  3. From Michael Scholz, in C++.
  4. From myself, in Haskell.
  5. From Frans Bouma, in C#.
  6. From Calvin Hisa, optimized version in Fox Pro.
  7. From Nicholas Allen, in JScript.
  8. From Brian C Robinson, in Python.  (Test case, example)
  9. From Anton Triest, in XSLT.  (Demo)
Published Tuesday, April 06, 2004 4:50 PM by the1

Comments

 

the1's WebLog said:

April 6, 2004 7:55 PM
 

Justin Rogers said:

Just to give the heads up, I revised the algorithm to 148 lines of code (I think this might be less than before). The mapping table is still the largest code-part. And the algorithm, while fast for a single operation or single number, truly excells at multiple numbers where the mapping table only needs to be processed the first time.
April 6, 2004 8:48 PM
 

Justin Rogers said:

PS > Awaiting a new challenge ;-)
April 6, 2004 8:50 PM
 

Justin Rogers, DigiTec Web Consultants, LLC. said:

April 6, 2004 11:53 PM
 

Frans Bouma's blog said:

April 7, 2004 5:31 AM
 

Justin Rogers, DigiTec Web Consultants, LLC. said:

April 7, 2004 2:34 PM
 

Justin Rogers said:

Submission entry 2 has been updated again as of this morning. The performance of a single number run has tripled, and the performance of multi number runs outperforms even that.
April 7, 2004 11:34 AM
 

the1's WebLog said:

August 20, 2004 5:31 PM
Anonymous comments are disabled

© 2009 Microsoft Corporation. All rights reserved. Terms of Use  |  Trademarks  |  Privacy Statement
Microsoft
Page view tracker