The potential of a word is found by adding the encrypted value of the letters The encryption of letters are to be done as follows : A=1 B=2 C=3……..

 The encryption of letters are to be done as follows :
 A=1
 B=2 
C=3…….. 

Z=26

The potential of a word is found by adding the encrypted value of the letters.
 Example: KItE 
POTENTIAL =11+9+20+5=45 
Accept a sentences which is terminated by either “.”,”,” ,”?”or”!”. Each word of sentences is separated by single space. 
Example :
Input : the sky is the limit . 
POTENTIAL : THE = 33 
 SKY = 55 
 IS= 28 
 THE = 33 
LIMIT = 63 
OUTPUT : IS THE SKY LIMIT

Answers:

import java.util.*;
class WordPotential
{
 int findPotential(String s) // Function to find potential of a word
 {
 s = s.toUpperCase();
 int p = 0, l = s.length();
 char ch;
 for(int i=0; i<l; i++)
 {
 ch = s.charAt(i);
 p = p + (ch-64); // if ch = 'A', then 'A'-64 = ASCII value of 'A' - 64 = 65-64 = 1
 }
 return p;
 }
 // Function to sort the words in ascending order of their potential
 void sortPotential(String w[], int p[])
 {
 int n = w.length, t1 = 0;
 String t2 = "";
 for(int i=0; i<n-1; i++)
 {
 for(int j=i+1; j<n; j++)
 {
 if(p[i]>p[j])
 {
 t1 = p[i];
 p[i] = p[j];
 p[j] = t1;
 t2 = w[i];
 w[i] = w[j];
 w[j] = t2;
 }
 }
 }
 printResult(w,p);
 }
 void printResult(String w[], int p[]) // Function to print the final result
 {
 int n = w.length;
 String ans = "";
 for(int i=0; i<n; i++)
 {
 ans = ans + " " + w[i];
 }
 ans = ans.trim();
 System.out.println("\nOutput\t\t : \t"+ans);
 }
 public static void main(String args[])
 {
 WordPotential ob = new WordPotential();
 Scanner sc = new Scanner(System.in);
 System.out.print("Enter a sentence : \t");
 String s = sc.nextLine();
 StringTokenizer str = new StringTokenizer(s," .,?!");
 int n = str.countTokens();
 String words[] = new String[n];
 int potential[] = new int[n];
 for(int i=0; i<n; i++)
 {
 words[i] = str.nextToken(); // Saving words one by one in an array
 potential[i] = ob.findPotential(words[i]); // Saving potential of every word
 }
 // Printing the words along with their potential
 System.out.print("\nPotential\t : \t");
 for(int i=0; i<n; i++)
 {
 System.out.println(words[i]+"\t= "+potential[i]);
 System.out.print("\t\t\t");
 }
 ob.sortPotential(words,potential);
 }

Output: