algorithems_codes_in_cpp/binary_search.cpp at main · sadikmahmudadive/algorithems_codes_in_cpp · 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
<<<<<<< HEAD
#include <iostream>

using namespace std;

int main()
{
    // Array of sorted integers
    int arr[100];
    int n;

    int target; // Element to search for
    int low = 0;   // Index of the lowmost element

    int foundIndex = 0; // Index where the target is found (-1 means not found)

    //for arry input
    cout << "Enter Array size : ";
    cin >> n;
    for(int i = 0; i < n; i++)
    {
        cout << "Enter array Elements " <<i <<": ";
        cin >> arr[i];
    }

    cout << "Enter the element you want to find : " ;
    cin >> target;

    int high = n - 1;
    while (low <= high)
    {
        int mid = low + (high - low) / 2; // Calculate the middle index

        if (arr[mid] == target)
        {
            foundIndex = mid;
            break; // Target found, exit the loop
        }
        else if (arr[mid] < target)
        {
            low = mid + 1; // Target is in the high half
        }
        else
        {
            high = mid - 1; // Target is in the low half
        }
    }

    if (foundIndex != 0)
    {
        cout << "Element " << target << " found at index " << foundIndex << endl;
    }
    else
    {
        cout << "Element " << target << " not found in the array." << endl;
    }

    return 0;
}
=======
#include <iostream>

using namespace std;

int main()
{
    // Array of sorted integers
    int arr[100];
    int n;

    int target; // Element to search for
    int low = 0;   // Index of the lowmost element

    int foundIndex = 0; // Index where the target is found (-1 means not found)

    //for arry input
    cout << "Enter Array size : ";
    cin >> n;
    for(int i = 0; i < n; i++)
    {
        cout << "Enter array Elements " <<i <<": ";
        cin >> arr[i];
    }

    cout << "Enter the element you want to find : " ;
    cin >> target;

    int high = n - 1;
    while (low <= high)
    {
        int mid = low + (high - low) / 2; // Calculate the middle index

        if (arr[mid] == target)
        {
            foundIndex = mid;
            break; // Target found, exit the loop
        }
        else if (arr[mid] < target)
        {
            low = mid + 1; // Target is in the high half
        }
        else
        {
            high = mid - 1; // Target is in the low half
        }
    }

    if (foundIndex != 0)
    {
        cout << "Element " << target << " found at index " << foundIndex << endl;
    }
    else
    {
        cout << "Element " << target << " not found in the array." << endl;
    }

    return 0;
}
>>>>>>> 59f02f6c7ef4248ba7d85964ef2a53455d58ad43