Data structures and algorithms

 searching algorithms in java ;

1- Binary search:

package dsalgo.sorting;

public class BinearySearchExampl {
public static void main(String[] args){
int [] array = {10,12,13,14,15,18,20,22};
boolean status = searchElement(0,array.length-1,11,array);
if (status){
System.out.println("Element Present ");
}else {
System.out.println("Element is Not Present in List");
}

}

private static boolean searchElement(int min, int max,int searchElement,int[] array){
int mid = (min + max)/ 2;
if (min > max){
return false;
}
if (searchElement == array[mid]){
return true;
}
if (searchElement > array[mid]){
return searchElement(mid+1,max,searchElement,array);
}else {
return searchElement(min,mid-1,searchElement,array);
}

}
}

2- linear search

public class LinearSearch {
public static void main(String [] args){
int [] array = {1,3,5,6,7,2,4};

boolean elementStatus = searchElement(10,array);

if (elementStatus){
System.out.println("Element Found In List");
} else {
System.out.println("Element Not Found List");
}

}

private static boolean searchElement(int element,int[] array){
for(int i=0;i<array.length;i++){
if (element == array[i]){
return true;
}
}
return false;

}
}

Bubble Sort in Java:

class BubbleSort{

public static void main( String [] args){

int [] array = {2,3,4,5,6,7,9,17,18,15,15,15};

     

     for(int i=0;i<array.length;i++){

      for(int j=0; j<array.length-1;j++){

if(array[j]> array[j+1]){

        

        int temp = array[j+1];

        array[j+1] = array[j];

          array[j] = temp;

         

         }

}

     

     }

     

     for(int i=0;i<array.length;i++){

     System.out.println(array[i]);

     }

}

}