Scribd
Upload
22 views

Java Program To Arrange Words in Ascending Order of Their Potential

The Java program takes a sentence as input, splits it into individual words, calculates a potential value for each word based on the ASCII values of its letters, sorts the words in ascending order of potential, and outputs the sorted list of words. It uses classes, methods, arrays, and loops to split the input, calculate potentials, sort words, and print the final result.

Uploaded by

krishna beriya
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views

Java Program To Arrange Words in Ascending Order of Their Potential

The Java program takes a sentence as input, splits it into individual words, calculates a potential value for each word based on the ASCII values of its letters, sorts the words in ascending order of potential, and outputs the sorted list of words. It uses classes, methods, arrays, and loops to split the input, calculate potentials, sort words, and print the final result.

Uploaded by

krishna beriya
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Java program to arrange words in Ascending or

Potential
/**
* The class WordPotential inputs a sentence and arranges the words
* in ascending order of their potential
* @author : www.guideforschool.com
* @Program Type : BlueJ Program - Java
* @ISC Computer Science Practical Specimen Paper - Question 2
*/

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
}
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);
}

You might also like