DSA-Practice/lecture9part2.cpp at main · Mayurpatel07/DSA-Practice · 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
// // scops in arrays

// #include<iostream>
// using namespace std ;

// int funtion(int arry[] ,  int n ) {
// cout<<"entring in function"<<endl ;
// arry[0] = 120;
//   for(int i = 0 ; i<=5 ; i++ ){
// cout<<arry[i]<<" " ;
//   }
// cout<<"entring in main function "<<endl;
// }

// int main() {

// int arry[5]={1,2,3,4,5};
// funtion( arry , 4) ;

// cout<<"printing arrays "<<endl ;
// for(int i = 0 ; i<=4 ; i++ ) {

// cout<<arry[i]<<' ' ;
// }
// }
// ______________________________________________________________________
// find that wheter 1 is present or absent in arry elements
liner search

#include<iostream>
using namespace std;

bool search(int arry[], int size, int key) {
    for (int i = 0; i < size; i++) {
        if (arry[i] == key) {
            return true;
        }
    }
    return false;
}

int main() {
    int arry[10] = {1, 43, 5, 352, 54, 34, 34, 24, 37, 35};

    int key;
    cout << "Enter the key which you want to find: ";
    cin >> key;

    bool found = search(arry, 10, key);

    if (found) {
        cout << "Key is present";
    } else {
        cout << "Key is absent";
    }

    return 0;
}

// ____________________________________________________________________
// reverse an array ;

#include<iostream>
using namespace std;

int reverseArr(int arr[], int n) {
    int start = 0;
    int end = n - 1;
    while (start <= end) {
        swap(arr[start], arr[end]);
        start++;
        end--;
    }
}

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

int main() {
    int arr[6] = {1, 2, 3, 4, 5, 6};

    reverseArr(arr, 6);
    printArr(arr, 6);

    return 0;
}

// #include<iostream>
// using namespace std ;
// void reverseArr(int arr[], int n) {
//     int start = 0 ;
//     int end = n -1 ;
// while(start<=end) {
//     swap(arr[start],arr[end]) ;
//     start ++ ;
//     end -- ;
// }
// }
// void printArr(int arr[] ,int  n ) {
//     for(int i = 0 ; i<n; i++ ){
//         cout<<arr[i]<<" " ;
//     }
//     cout<<endl ;
// }

// int main() {

// int arr[5]={1,2,7,8,5} ;

// reverseArr(arr , 5) ;
//  printArr(arr, 5) ;

     return 0 ;
}