dsa-programs/Lecture33.cpp at main · Aadharbindal/dsa-programs · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
#include<iostream>
using namespace std;

void print(int arr[], int n) {
    cout << "Size of array is " << n << endl;

    for(int i=0; i<n; i++) {
        cout << arr[i] << " ";
    } cout << endl;

}

void print(int arr[], int s, int e) {

    for(int i=s; i<=e; i++) {
        cout << arr[i] << " ";
    } cout << endl;
}

bool binarySearch(int arr[], int s, int e , int k ) {
    cout<<endl;
    print(arr,s,e);
    //base case

    //element not found
    if(s>e)
        return false;

    int mid = s + (e-s)/2;

    //element found
    if(arr[mid] == k)
        return true;

    if(arr[mid] < k) {
        return binarySearch(arr, mid+1, e, k);
    }
    else{
        return binarySearch(arr, s, mid-1, k);
    }
}

bool linearSearch(int arr[], int size, int k ) {
    print(arr,size);
    //base case
    if(size == 0)
        return false;

    if(arr[0] == k) {
        return true;
    }
    else {
        bool remainingPart = linearSearch(arr+1, size-1, k );
        return remainingPart;
    }
}

int getSum(int *arr, int size) {

    //base case
    if(size == 0) {
        return 0;
    }
    if(size == 1 )
    {
        return arr[0];
    }

    int remainingPart = getSum(arr+1, size-1);
    int sum = arr[0] + remainingPart;
    return sum;
}

bool isSorted(int arr[], int size) {

//base case
if(size == 0 || size == 1 ){
    return true;
}

if(arr[0] > arr[1])
    return false;

else {
    bool remainingPart = isSorted(arr + 1, size - 1 );
    return remainingPart;
}
}

int main() {

// int arr[5] = {2,4,9,9,9};
// int size = 5;

// bool ans = isSorted(arr, size);

// if(ans){
//     cout << "Array is sorted " << endl;
// }
// else {
//     cout << "Array is not sorted " << endl;
// }

// int sum = getSum(arr, size);

// cout << "Sum is " << sum << endl;

//int arr[5] = {3,5,1,2,6};
//int size = 5;
// int key = 6;
// bool ans = linearSearch(arr, size, key);

// if(ans ){
//     cout << "Present " << endl;
// }
// else{
//     cout << "absent " << endl;
// }

int arr[11] = {2,4,6,10,14,18,22,38,49,55,222};
int size = 11;
int key = 222;
cout << "Present or not " << binarySearch(arr, 0, 10, key) << endl;
return 0;

}