I can not find an algorithm to find out from user input of a word whether it is an isogram or not. How can I break a word and check letters for being an isograms or not?
Update: Can't seem to find a hash function to narrow it down.
20060919 Janitored by Corion: Restored original node text 2006-09-20 Retitled by planetscape, as per Monastery guidelines ( keep:0 edit:15 reap:0 )
Original title: 'testing number of occurances in a word'
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|
