From 0cb632505fdfb5651e650c1792923fca7243b5b7 Mon Sep 17 00:00:00 2001 From: rakesh_1620 Date: Thu, 6 Oct 2022 12:40:30 +0530 Subject: [PATCH 1/3] binary search algorithm added --- binary search/binary searcch algorithm.java | 30 +++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 binary search/binary searcch algorithm.java diff --git a/binary search/binary searcch algorithm.java b/binary search/binary searcch algorithm.java new file mode 100644 index 0000000..807e784 --- /dev/null +++ b/binary search/binary searcch algorithm.java @@ -0,0 +1,30 @@ +class BinarySearchExample{ + + public static void binarySearch(int arr[], int first, int last, int key){ + int mid = (first + last)/2; + + while( first <= last ){ + if ( arr[mid] < key ){ + first = mid + 1; + }else if ( arr[mid] == key ){ + System.out.println("Element is found at index: " + mid); + break; + }else{ + last = mid - 1; + } + mid = (first + last)/2; + } + + if ( first > last ){ + System.out.println("Element is not found!"); + } + } + + public static void main(String args[]){ + // creating Array + int arr[] = {10,20,30,40,50}; + int key = 30; // element to be search + int last=arr.length-1; + binarySearch(arr,0,last,key); + } + } \ No newline at end of file From 0bdf26aa2b6517a189c82dfe9bff153f3aad5964 Mon Sep 17 00:00:00 2001 From: rakesh_1620 Date: Thu, 6 Oct 2022 15:49:41 +0530 Subject: [PATCH 2/3] initial commit --- binary search/binary searcch algorithm.java | 30 --------------------- 1 file changed, 30 deletions(-) delete mode 100644 binary search/binary searcch algorithm.java diff --git a/binary search/binary searcch algorithm.java b/binary search/binary searcch algorithm.java deleted file mode 100644 index 807e784..0000000 --- a/binary search/binary searcch algorithm.java +++ /dev/null @@ -1,30 +0,0 @@ -class BinarySearchExample{ - - public static void binarySearch(int arr[], int first, int last, int key){ - int mid = (first + last)/2; - - while( first <= last ){ - if ( arr[mid] < key ){ - first = mid + 1; - }else if ( arr[mid] == key ){ - System.out.println("Element is found at index: " + mid); - break; - }else{ - last = mid - 1; - } - mid = (first + last)/2; - } - - if ( first > last ){ - System.out.println("Element is not found!"); - } - } - - public static void main(String args[]){ - // creating Array - int arr[] = {10,20,30,40,50}; - int key = 30; // element to be search - int last=arr.length-1; - binarySearch(arr,0,last,key); - } - } \ No newline at end of file From 97793e4a7bd5df827804c9ba5ce8ba6284e3ec05 Mon Sep 17 00:00:00 2001 From: rakesh_1620 Date: Thu, 6 Oct 2022 16:10:53 +0530 Subject: [PATCH 3/3] exponential searching is added in searching folder --- Searching/exponential_search.java | 37 +++++++++++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 Searching/exponential_search.java diff --git a/Searching/exponential_search.java b/Searching/exponential_search.java new file mode 100644 index 0000000..c2bc64c --- /dev/null +++ b/Searching/exponential_search.java @@ -0,0 +1,37 @@ +// Java program to +// find an element x in a +// sorted array using +// Exponential search. +import java.util.Arrays; + +class exponential_search +{ + // Returns position of + // first occurrence of + // x in array + static int exponentialSearch(int arr[],int n, int x) + { + // If x is present at first location itself + if (arr[0] == x) + return 0; + + // Find range for binary search by + // repeated doubling + int i = 1; + while (i < n && arr[i] <= x) + i = i*2; + + // Call binary search for the found range. + return Arrays.binarySearch(arr, i/2,Math.min(i, n-1), x); + } + + // Driver code + public static void main(String args[]) + { + int arr[] = {2, 3, 4, 10, 40}; + int x = 10; + int result = exponentialSearch(arr,arr.length, x); + + System.out.println((result < 0) ? "Element is not present in array" : "Element is present at index " + result); + } +}