//wap to store 5 characters in a single dimensional array and sort them in decending order

//wap to store 8 names in a single dimensional array and sort them in ascending order

import java.util.*;

class bubblesort

{

static void main()

{

Scanner sc=new Scanner (System.in);

int n[]=new int[6];

int k,p,temp=0;

System.out.println("enter no.s");

for (k=0;k<6;k++)

{

n[k]=sc.nextInt();

}

//sorting

for(k=0;k<6;k++)

{

for(p=0;p<5;p++)

{

if(n[p]>n[p+1])

{

temp=n[p];

n[p]=n[p+1];

n[p+1]=temp;

}

}

}

System.out.println("sorted list");

for(k=0;k<6;k++)

{

System.out.println(n[k]);

}

}

}

import java.util.*;

class linearsearch

{

static void main()

{

Scanner sc=new Scanner (System.in);

int n[]=new int[10],k,s,f=0;

System.out.println("enter elements");

for(k=0;k<n.length;k++)

{

n[k]=sc.nextInt();

}

System.out.println("enter no. to be searched");

s=sc.nextInt();

for(k=0;k<n.length;k++)

{

if(n[k]==s)

{

f=1;

break;

}

}

if(f==1)

System.out.println("no. is found");

else

System.out.println("no. doesnt exist");

}}

class loop

{

void hehe()

{

int k;

for (k=1;k<=10;k++)

{

System.out.println(k);

}}

void hehe1(){

int j;

for (j=10;j<=1;j--)

{

System.out.println(j);

}

}

}