Question

DONE IN C++ ONLY. C++ C++

This week you should get some experience with I reporting errors from functions using exceptions I writing templated functions Part 1

1. Implement the linear and binary search functions. Each function should take as a formal parameter an array of integers (of size less than 100) and returns (a) in the case of successful search – the position (index) of the target in the array (b) in the case of unsuccessful search – an exception with the message “Unsuccessful search” thrown from the function to the user.

2. The binary search works correctly only when the input is sorted. This requirement should be satisfied before the algorithm starts the search operation. Therefore if the input is unsorted the exception with the message “Unsorted input” should be thrown by the function. 3. Test the two search functions on the different inputs in the main function. Use const size to define the number of input

Answer 1

Solution:

linear search code:

#include <iostream>
using namespace std;

int linearSearch(int array[], int len, int searchElement)
{
   int i;
   for (i = 0; i < len; i++)
       if (array[i] == searchElement)
           return i;
   return -1;
}

int main(void)
{
   int array[] = { 13, 5, 12, 43, 54, 2, 9, 7, 6, 95 };
   int searchElement = 9;
   int len = sizeof(array) / sizeof(array[0]);
   int result = linearSearch(array, len, searchElement);
(result == -1)? cout<<"The search element is not found in the array"
               : cout<<"The element is present at index " <<result;
return 0;
}

Output:

binary search code:

#include<iostream> //i/o library
using namespace std;
int binarySearch(int array[], int left, int right, int search, int count)
{
  
   count++;
while (left <= right)
{
int mid = left + (right-left)/2;

if (array[mid] == search)
  
return mid;

if (array[mid] < search)
return binarySearch(array, left, mid-1, search, count);


else
return binarySearch(array, mid+1, right, search, count);
}

  
return count;
}

int main(){
   int count= 0;
   int array[]= {5, 12, 25, 32, 38, 46, 58, 62, 85, 90, 97, 105, 110};
   count= binarySearch(array, 0, 12, 32, count);
   cout<<count;
  

return 0; //This is to make sure that the program terminates
}

Output:

Hit the thumbs up if you liked the answer. :)