public class SearchingTech { public static void main(String[] args) { String[] names={"Prashant","Stuti","Aman","Archit","Rinky"}; int i,j; String temp; for (i=0;i<names.length;i++) { for (j=0;j< names.length-1-i;j++) { if(names[j].compareTo(names[j+1])>0) { temp=names[j+1]; names[j+1]=names[j]; names[j]=temp; } } } System.out.print("Sorted string list : "); for (i=0;i<names.length;i++) System.out.print(names[i]+" "); } }
-
Notifications
You must be signed in to change notification settings - Fork 0
Writecodes/Reverse-a-string
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published