Напишите шаблонные функции для: - линейного поиска; - двустороннего поиска; - бинарного поиска;

#include <iostream>
using namespace std;
 
// linear search template function
// arr: array
// n: size of array
// x: value to search
// the function returns the index of x if it is present in arr
// otherwise it returns -1
template <class T>
int LinearSearch(T arr[], int n, T x) {
 
    for (int i = 0; i < n; ++i) {
 
        if (arr[i] == x)
            return i;
 
    }
 
    return -1;
 
}
 
int main() {
 
    int arr[] = { 6 , 43 ,23 ,6, 12 ,43, 3, 4, 2, 6 };
    int n, index, x;
    n = sizeof(arr) / sizeof(int); // size of arr
 
    cout << "Integer Array: ";
    for (int i = 0; i < n; ++i) cout << arr[i] << ' ';
    cout << endl;
 
    cout << "Enter Value you want to search: ";
    cin >> x;
 
    index = LinearSearch(arr, n, x);
 
    if (index != -1)
        cout << x << " is present in the array at position " << index << endl;
    else
        cout << x << " is not present in the array \n" << endl;
        
    /*-----------------------------------------------------------------------------*/
 
    char charArr[] = { 'A', 'v', 'D', 'R', 'T','u', 'j', 'o' };
    char c;
    n = sizeof(charArr) / sizeof(char);
 
    cout << "Char Array: ";
    for (int i = 0; i < n; ++i) cout << charArr[i] << ' ';
    cout << endl;
 
    cout << "Enter character you want to search: ";
    cin >> c;
 
    index = LinearSearch(charArr, n, c);
 
    if (index != -1)
        cout << c << " is present in the array at position " << index << endl;
    else
        cout << c << " is not present in the array " << endl;
 
}

#include<iostream>
using namespace std;
 
// binary search function using template
// n: size of arr
// x: value to search
// the fucntion returns -1 if x is not found in arr
// otherwise it returns index of x
template<typename T>
int binary_search(T arr[],int n,T x)
{
    int start = 0;
    int end = n-1;
    while(start<=end)
    {
        int mid = (start+end)/2;
        if(arr[mid]==x) 
            return mid;
        else if(arr[mid]<x) 
            start = mid + 1;
        else    
            end = mid - 1;
    }
    return -1;
}
 
// Template function to print array
// n: size of arr
template<typename T>
void PrintArray(T arr[], int n)
{
    for (int i = 0; i < n; ++i)
        cout << arr[i] << " ";
    cout << "\n\n";
}
 
int main()
{
 
    int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 ,12 };
    int n = sizeof(arr) / sizeof(int);
 
    cout << "Array : " << endl;
    PrintArray(arr, n);
    
    int x, index;
    cout<<"Enter value you want to Search: ";
    cin>>x;
    
    index = binary_search(arr, n, x);
    
    if(index==-1)
        cout<<x<<" is not present in the array"<<endl;
    else
        cout<<x<<" is present in the array at position "<<index<<endl;
 
}

#include<stdio.h>
int ternary_search(int arr[], int n, int x) {
    int start = 0;
    int end = n - 1;
    int mid1;
    int mid2;
    while (start <= end) {
        int mid1 = (end - start) / 3 + start;
        int mid2 = 2 * (end - start) / 3 + start;
        if (x == arr[mid1]) {
            return mid1;
        }
        else if (x == arr[mid2]) {
            return mid2;
        }
        else if (x < arr[mid1]) {
            end = mid1 - 1;
        }
        else if (x < arr[mid2]) {
            start = mid1 + 1;
            end = mid2 - 1;
        }
        else {
            start = mid2 + 1;
        }
    }
    return -1;
}
int main()
{
    int arr[] = { 2,3,5,7,10,10,11,15,17,20,25,30,32,36,40 };
    int n = 15;
    int index;
    int x;
    printf("Enter element you want to search: ");
    scanf("%d", &x);
    index = ternary_search(arr, n, x);
    if (index != -1) {
        printf("%d%s%d", x, " is present at index ", index);
    }
    else {
        printf("%d%s", x, " is not present in the given array\n");
    }
}