News for hackers. Stuff that matters.
Re:I'm a cargo cult programmer, help me by flozimm on Saturday February 26, 2011 @05:35AM (#2265277)
Would this work as a solution:

i) convert the array of arrays of chars into an array of arrays of integers (the letters ASCII values).

ii) create a new integer array containing the sum of the cubes of each ASCII value for each entry

iii) create an empty hash table and fill it with (key|value) pairs containing (integer|number of occurrences) by looping through the previous array

iv) sort the hash table by 'number of occurrences' and store the biggest (key|value) pair

v) look for the first match in the original array to find which chars it represents

Efficient/correct or not?

Re:I'm a cargo cult programmer, help me by jimktrains2 on Tuesday March 01, 2011 @11:43AM (#2276093)
Why not just use a tree?