programming1/midLab.cpp at master · shriyajalana/programming1 · 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
127
128
129
130
131
132
133
134
135
136
137
#include <iostream>
using namespace std;

void lowerBound(int arr[], int n, int target)
{
    int low = 0;
    int high = n - 1;
    int mid;
    int index = -1;
    while (low <= high)
    {
        mid = (low + high) / 2;
        if (arr[mid] == target)
        {
            index = mid;
            break;
        }
        else if (arr[mid] < target)
        {
            low = mid + 1;
        }
        else
        {
            high = mid - 1;
        }
    }
    if (index == -1)
    {
        cout << "lowerBound is: " << low << endl;
    }
    else
    {
        cout << "element is present " << index << endl;
    }
}

void UpperBound(int arr[], int n, int target)
{
    int low = 0;
    int high = n;
    int mid;
    int index = -1;
    while (low <= high)
    {
        mid = (low + high) / 2;
        if (arr[mid] == target)
        {
            index = mid;
            break;
        }
        else if (arr[mid] < target)
        {
            low = mid + 1;
        }
        else
        {
            high = mid - 1;
        }
    }
    if (index == -1)
    {
        cout << low << endl;
    }
    else
    {
        cout << index + 1 << endl;
    }
}
int main()
{
    int arr[] = {4, 7, 13, 24, 45, 56, 67, 439};
    int low = 0;
    int n = 8;
    int high = 7;
    int mid;
    int target = 5;
    int result = -1;
    lowerBound(arr, n, 48);  //lowerBound return if element is present otherwise next greater element
    UpperBound(arr, n, 439); //lowerBound return if element is present otherwise next greater element
    while (low <= high)
    {
        mid = (low + high) / 2;
        if (arr[mid] == target)
        {
            result = mid;
            break;
        }
        else if (arr[mid] < target)
        {
            low = mid + 1;
        }
        else
        {
            high = mid - 1;
        }
    }
    if (result == -1)
    {
        cout << "not present\n";
    }
    else
    {
        cout << "Element present at index " << result << " and element is " << arr[result] << endl;
    }
    return 0;
}
=======
 if (pos == 1)
 {
 if (start == NULL)
 {
 start = temp;
 start->next = NULL;
 }
 else
 {
 ptr = start;
 start = temp;
 start->next = ptr;
 }
 }
 else if (pos > 1 && pos <= counter)
 {
 s = start;
 for (i = 1; i < pos; i++)
 {
 ptr = s;
 s = s->next;
 }
 ptr->next = temp;
 temp->next = s;
 }
 else
 {
 cout<<"Positon out of range"<<endl;
 }
}