├── Binary_search_algorithm_in_datastructures_using_c++ ├── Linear_search_algorithm_using_c++ └── README.md /Binary_search_algorithm_in_datastructures_using_c++: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int binarySearch(int myarray[], int beg, int end, int key) 5 | { 6 | int mid; 7 | if(end >= beg) { 8 | mid = (beg + end)/2; 9 | if(myarray[mid] == key) 10 | { 11 | return mid+1; 12 | } 13 | else if(myarray[mid] < key) { 14 | return binarySearch(myarray,mid+1,end,key); 15 | } 16 | else { 17 | return binarySearch(myarray,beg,mid-1,key); 18 | } 19 | } 20 | return -1; 21 | } 22 | int main () 23 | { 24 | int myarray[10] = {5,8,10,13,21,23,25,43,54,75}; 25 | int key, location=-1; 26 | 27 | 28 | cout<<"The input array is"<>key; location = binarySearch(myarray, 0, 9, key); 35 | if(location != -1) { 36 | cout<<"Key found at location "< 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | int myarray[10] = {21,43,23,54,75,13,5,8,25,10}; 7 | int key,loc; 8 | cout<<"The input array is"<>key; 15 | for (int i = 0; i< 10; i++) 16 | { 17 | if(myarray[i] == key) 18 | { 19 | loc = i+1; break; 20 | } 21 | else 22 | loc = 0; 23 | } 24 | if(loc != 0) 25 | { 26 | cout<<"Key found at position "<