So would it be possible to then divide the hash by the value of one character of the string, so you would be able to work out the other character if it was a two character string.
As far as representing data as a single "value", there are several algorithms which can achieve this. Hashing or CRC come to mind. E.G. if you hash your string then you have a single "hash value" that represents that whole string, (not just a single letter) which when given the same string, will produce the same hash
I am trying to make a program which can score poker hands, I was hinted by my tutor that you need to work out the ASCII values of each cards, then rank them. From this you would be able to then determine which cards are present ( perhaps by division, and also how many of that card there is ) and then give the hand a score. Perhaps I am just going about it the long way.
Since the ASCII values can be printed out in order (although some are dicey to print because they are used to control the monitor or are a non-printing character), I'm not sure why you'd want to sort them.