I have an array which contains some strings. For each character of a string an integer value is assigned. For example a=2,b=5,c=6 ,o=1,k=3 etc
The final value in the a string is the sum of the character’s value. So that for an example string “BOOK” the string will be stored as “BOOK (7)”. Similarly every string will have a final integer value. I would like to sort these array with these final integer values stored in the string which is present in each array index. The array contains more than 200,000 words. So the sorting process should be pretty fast. Is there any method for it?
A brutal quick example could be, if your strings structure is always the same, like “Book (7)” you can operate on the string by finding the number between the “()” and then you can use a dictionary to store temporally the objects:
This prints: