Skip to main content

Sorting a Given List Of Names in Ascending Order

import java.io.*;
class Ascending
{           public static void main(String[] args)throws IOException 
 {
  BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); 
  System.out.println("enter the number of strings");
  int n=Integer.parseInt(br.readLine());
  String s[]=new String[n];
  for(int i=0;i<n;i++)
  {          System.out.println("enter the string");
   s[i]=br.readLine();
                       }
  System.out.println("the strings in ascending order are");
  for(int i=0;i<n-1;i++)
  {          for(int j=0;j<(n-(i+1));j++)
   {
    if(s[j].compareTo(s[j+1])>0)
    {
     String s1=new String();
     s1=s[j];
     s[j]=s[j+1];
     s[j+1]=s1;
    }
   }
  }
  for(int i=0;i<n;i++)
   System.out.println(s[i]);
 }
}

Comments

Popular posts from this blog

Find Value of S=ut+1/2*a*t**2.

PROCEDURE:-        1.enter values for u,a,t to find distance        2.find distance with the formulae ut+1/2at 2        3.print the above result CODE:- #include<stdio.h> #include<conio.h> void main() {   float u,t,a,S;   clrscr();   printf(“enter values u,t,a”);   scanf(“%f %f %f”, &u,&t,&a);   S=(u*t)+(0.5*a*t*t);   printf(“\n  S = %f”, S); } Input:- enter values u,t,a               U=10,t=4,a=4.9 Output:- S =79.200

Check whether a given number is Fibonacci prime or not.

PROCEDURE:- 1.input an integer n 2. first check whether it is prime or not 3. if it prime check whether it is in the Fibonacci series 4.the above check can be made by generating series and comparing each number with n 5.if n is found in the series then n is Fibonacci prime 6.else it is not Fibonacci prime   CODE:- #include<stdio.h> void main(){ int n,i=2,k=0,a,b,i,m; printf(“enter the number”); scanf(“%d”,&n); while(i<=n/2) { if(n%i = = 0)   {     k=1; break;   } i++; } if(k!=1) { a=0; b=1; i=1; m=n; while(i<=m) {   c=a+b;    if(m= =c)     {      printf(“ %d is Fibonacci prime”,n);    break;     } a=b; b=c; i++; } if(m!=c) printf(“%d  Not Fibonacci prime”,n); } else printf(“not prime “); } Input:- enter the number  13 Output:- 13 is Fibonacci prime