lavakumarfire999
BAN USERimport java.util.Scanner;
class dictionary{
public static void main(String[]args){
Scanner scan=new Scanner(System.in);
String[] temp=new String[10];
char[] arr={'e','o', 'b', 'a', 'm', 'g', 'l'};
String[] Dict={"go","bat","me","eat","goal","boy","run"};
int val=0,k=0,len=0;
for(int i=0;i<7;i++)
{
val=0;
for(int j=0;j<7;j++)
{
len=Dict[i].length();
if(Dict[i].contains((arr[j]+"")))
{
val++;
}
}
if(val==len)
{
temp[k]=Dict[i];
len=0;
k++;
}
}
for(int i=0;i<k;i++)
{
System.out.println(temp[i]);
}
}
}
import java.util.Scanner;
class binarysearch{
public static void main(String[]args){
Scanner scan=new Scanner(System.in);
int c, first, last, middle, n, search;
int array[]=new int[100];
System.out.println("Enter number of elements");
n=scan.nextInt();
for (c = 0; c < n; c++)
array[c]=scan.nextInt();
System.out.println("Enter value to find\n");
search=scan.nextInt();
first = 0;
last = n - 1;
middle = (first+last)/2;
while (first <= last) {
if (array[middle] < search)
first = middle + 1;
else if (array[middle] == search) {
System.out.println(search+"found at location "+(middle+1));
break;
}
else
last = middle - 1;
middle = (first + last)/2;
}
if (first > last)
System.out.println("Not found! "+search+" is not present in the list");
}
}
{{
import java.util.Scanner;
class reverse{
public static void main(String[]args){
Scanner scan=new Scanner(System.in);
System.out.println("Enter A String");
String s=scan.next();
String r="";
for(int i=s.length()-1;i>=0;i--){
r=r+(char)s.charAt(i);
}
System.out.println("Reverse O f a String "+r);
}
}
}}
Radix sort is much more efficient than ant other sorting techniques like quick,merge etc.
- lavakumarfire999 January 02, 2017having less time complexity