Binary Search Example using Char (Java)

In this post, I am giving an example about implementing Binary Search in Java using characters as data types.


import java.io.*;

public class BinarySearch {
static char[] arr = new char[]{'a','c','f','g','h','q','u','v','w','z'} ;

public static void main (String []args) {
char searchElement = 'q' ;
int lLimit = 0 ;
int uLimit = arr.length ;

traversal (lLimit, uLimit, searchElement) ;
}


public static void traversal (int lLimit, int uLimit, char searchElement) {

int midElement = (lLimit + uLimit) / 2 ;


if (arr[midElement] == searchElement) {
System.out.println(" Element " + searchElement + " found at location: " + midElement) ;
} else if (searchElement < arr[midElement] ) {
traversal(lLimit, midElement,searchElement) ;
} else if (searchElement > arr[midElement] ) {

traversal(midElement, uLimit, searchElement) ;
}
}
}


Output: Element q found at location: 5 

Linear Search Example using Char (Java)

In this post, I am giving an example about implementing Linear Search in Java using characters as data types. This is one of the most easiest searching technique in data structures.

import java.io.* ;

public class LinearSearch {

public static void main(String []a) {
char[] arr = new char[]{'a','c','f','g','h','q','u','v','w','z'} ;
int arrSize = arr.length ;
int flag = 0 ;
char element = 'v' ;

System.out.print("Data is :") ;
for (int j = 0 ; j < arrSize; j++)
System.out.println(arr[j] + "  ") ;

for (int k = 0 ; k < arrSize ; k++) {
if (arr[k] == 'v') {
flag = 1 ;
break ;
}
}
if (flag == 0)
System.out.println("Element not found: " + element ) ;
else if (flag == 1)
System.out.println("Element found: "+ element) ;
}
}