Skip to main content

Java program To read a string and change it to alphabetical order. eg STRING=GINRST


import java.io.*;

class charsort
{ public static void main(String args[])throws IOException
   { String s1;
      char temp;
   
      DataInputStream in=new DataInputStream(System.in);
      System.out.print("\n\n Enter string:  ");
      s1=in.readLine();

      char z[]=new char[s1.length()];
      z[0]+=s1.charAt(0);
      for(int i=1;i<s1.length();i++)
      { z[i]+=s1.charAt(i);
         
         for(int j=0;j<=i;j++)
         { for(int k=j+1;k<=i;k++)
           { if(z[j]>z[k])
              { temp=z[k];
                 z[k]=z[j];
                 z[j]=temp;
              }
            }
          }
        }
       System.out.print("\n\n Sorted string is:  ");
       for(int m=0;m<s1.length();m++)
       System.out.print(z[m]);
}
}
     

Comments

Popular posts from this blog

Use Case Diagram for Online Book Store

Online Movie Ticket Booking Sequence Diagram

Linear search & Binary search using Template

Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. #include<iostream> using namespace std; template <class T> void Lsearch(T *a, T item, int n) { int z=0; for(int i=0;i<n;i++) { if(a[i]== item) { z=1; cout<<"\n Item found at position = "<<i+1<<"\n\n"; } else if(z!=1) { z=0; } } if(z==0) cout<<"\n Item not found in the list\n\n"; } template <class T> void Bsearch(T *a, T item, int n) { int beg=0,end=n-1; int mid=beg+end/2; while((a[mid]!=item) && (n>0)) { if(item>a[mid]) beg=mid; else end=mid; mid=(beg+end)/2; n--; } if(a[mid]==item) cout<<"\n Item found at position = "<<mid+1<<"\n\n"; else cout<<"\n Item not found in the list\n\n"; } void main() { int iarr[10] = {2,42,56,86,87,99,323,546,767,886};