Bubble Sorting of Numbers
import [Link].*;
class bubble_sort_number
{
public static void main(String[] args)
{
[Link]("enter size of array");
Scanner sc=new Scanner([Link]);
int n=[Link]();
int a[]=new int[n];
int temp;
[Link]("enter number in array");
for (int i=0; i<n; i++)
{
a[i]=[Link]();
}
for (int i=0 ; i<n; i++)
{
for (int j=0; j<n-1-i; j++)
{
if (a[j]>a[j + 1])
{
temp=a[j];
a[j]=a[j + 1];
a[j+1]=temp;
}
}
}
for(int i=0;i<[Link];i++)
{
[Link](a[i]+" ");
}
}
}
Bubble Sorting of Names
import [Link].*;
class bubble_word
{
public static void main(String args[])
{
Scanner sc=new Scanner([Link]);
[Link]("enter size of array");
int n=[Link]();
[Link]("enter word in array");
String ar[]=new String[n];
for(int i=0;i<n;i++)
{
ar[i]=[Link]();
}
for(int i=0; i<n; i++)
{
for(int j=0; j<n-i-1; j++)
{
if (ar[j].compareTo(ar[j+1])>0)
{
String t=ar[j];
ar[j]=ar[j+1];
ar[j+1]=t;
}
}
}
[Link]("\nsorted array");
for(int i=0;i<n;i++)
{
[Link](ar[i]);
}
}
}
Selection Sorting of Number
import [Link].*;
class selection_sorting_number
{
public static void main(String[] args)
{
[Link]("enter size of array");
Scanner sc = new Scanner([Link]);
int n = [Link]();
int a[] = new int[n];
[Link]("enter number in array");
for (int i = 0; i < n; i++)
{
a[i] = [Link]();
}
int temp,min,j;
for (int i = 0; i < n; i++)
{
min = i;
for (j = i+1; j < n; j++)
{
if (a[j]<a[min])
{
min = j;
}
}
temp = a[i];
a[i] = a[min];
a[min] = temp;
}
for (int i = 0; i < n; i++)
{
[Link](a[i] + " ");
}
}
}
Selection Sorting of Names
import [Link].*;
class selection_sorting
{
public static void main(String[] args)
{
[Link]("enter size of array");
Scanner sc = new Scanner([Link]);
int n = [Link]();
String a[] = new String[n]; int min,j;
[Link]("enter number in array");
for (int i = 0; i < [Link]; i++)
{
a[i] = [Link]();
}
String temp;
for (int i = 0; i < [Link]; i++)
{
min = i;
for (j = i+1; j < [Link]; j++)
{
if (a[j].compareTo(a[min])<0)
{
min = j;
}
}
temp = a[i];
a[i] = a[min];
a[min] = temp;
}
for (int i = 0; i < [Link]; i++)
{
[Link](a[i] + " ");
}
}
}
Linear Searching
import [Link].*;
class linear_searching
{
public static void main(String args[])
{
Scanner sc=new Scanner([Link]);
[Link]("enter size of array");
int n=[Link]();
int a[]=new int[n];
[Link]("enter number in array");
for(int i=0;i<[Link];i++)
{
a[i]=[Link]();
}
[Link]("enter number to search");
int number=[Link](); int c=0;
for(int i=0;i<[Link];i++)
{
if(number==a[i])
{
c++;
[Link]("number found at "+i+" index number");
}
}
if(c==0)
[Link]("number not found");
else
[Link]("number found "+c+" times");
}
}
Binary Searching of Number
import [Link].*;
class binary_search_num
{
public static void main(String args[])
{
int i, n, item, first, last, middle;
Scanner sc = new Scanner([Link]);
[Link]("enter number of elements");
n = [Link]();
int array[] = new int[n];
[Link]("enter " + n + " integers");
for (i = 0; i < n; i++)
{
array[i] = [Link]();
}
[Link]("enter the search value:");
item=[Link]();
first=0; last=n-1;middle=(first+last)/2;
while( first <= last )
{
if ( array[middle] < item )
first = middle + 1;
else if ( array[middle] == item )
{
[Link](item+" found at "+middle +".");
break;
}
else
{
last = middle - 1;
}
middle = (first + last)/2;
}
if ( first > last )
[Link](item + " is not found.\n");
}
}
Binary Searching of Names
import [Link].*;
class binary_name
{
static int binarySearch(String[] arr, String x)
{
int l=0, r=[Link]-1;
while (l<=r)
{
int m=l+(r-l)/2;
int res=[Link](arr[m]);
if (res==0)
return m;
if (res>0)
l=m+1;
else
r=m-1;
}
return -1;
}
public static void main(String[] args)
{
Scanner sc=new Scanner([Link]);
[Link]("enter size of array");
int n=[Link]();
String arr[]=new String[n];
[Link]("enter word in array");
for(int i=0;i<n;i++)
{
arr[i]=[Link]();
}
[Link]("enter word to search");
String x=[Link]();
int result=binarySearch(arr, x);
if (result==-1)
[Link]("word not present");
else
[Link]("word found at" + "index "+result);
}
}