//linear search

include

using namespace std;

int main() { int n; cout << "Enter number of elements: "; cin >> n;

int arr[n];
cout << "Enter " << n << " elements: ";
for (int i = 0; i < n; i++)
    cin >> arr[i];

int key;
cout << "Enter element to search: ";
cin >> key;

int index = -1;
for (int i = 0; i < n; i++) {
    if (arr[i] == key) {
        index = i;
        break;
    }
}

if (index != -1)
    cout << "Element found at index " << index << endl;
else
    cout << "Element not found" << endl;

return 0;

} //Binary search

include

using namespace std;

int main() { int n; cout << "Enter number of elements: "; cin >> n;

int arr[n];
cout << "Enter " << n << " elements in sorted order: ";
for (int i = 0; i < n; i++)
    cin >> arr[i];

int key;
cout << "Enter element to search: ";
cin >> key;

int low = 0, high = n - 1, index = -1;
while (low <= high) {
    int mid = low + (high - low) / 2;
    if (arr[mid] == key) {
        index = mid;
        break;
    } else if (arr[mid] < key) {
        low = mid + 1;
    } else {
        high = mid - 1;
    }
}

if (index != -1)
    cout << "Element found at index " << index << endl;
else
    cout << "Element not found" << endl;

return 0;

} //insertion sort

include

using namespace std;

int main() { int n; cout << "Enter number of elements: "; cin >> n;

int arr[n];
cout << "Enter " << n << " elements: ";
for (int i = 0; i < n; i++)
    cin >> arr[i];

for (int i = 1; i < n; i++) {
    int key = arr[i];
    int j = i - 1;
    while (j >= 0 && arr[j] > key) {
        arr[j + 1] = arr[j];
        j--;
    }
    arr[j + 1] = key;
}

cout << "Sorted array: ";
for (int i = 0; i < n; i++)
    cout << arr[i] << " ";
cout << endl;

return 0;

} //selection sort

include

using namespace std;

int main() { int n; cout << "Enter number of elements: "; cin >> n;

int arr[n];
cout << "Enter " << n << " elements: ";
for (int i = 0; i < n; i++)
    cin >> arr[i];

for (int i = 0; i < n - 1; i++) {
    int minIndex = i;
    for (int j = i + 1; j < n; j++) {
        if (arr[j] < arr[minIndex])
            minIndex = j;
    }
    int temp = arr[i];
    arr[i] = arr[minIndex];
    arr[minIndex] = temp;
}

cout << "Sorted array: ";
for (int i = 0; i < n; i++)
    cout << arr[i] << " ";
cout << endl;

return 0;

} //Bubble sort

include

using namespace std;

int main() { int n; cout << "Enter number of elements: "; cin >> n;

int arr[n];
cout << "Enter " << n << " elements: ";
for (int i = 0; i < n; i++)
    cin >> arr[i];

for (int i = 0; i < n - 1; i++) {
    for (int j = 0; j < n - i - 1; j++) {
        if (arr[j] > arr[j + 1]) {
            int temp = arr[j];
            arr[j] = arr[j + 1];
            arr[j + 1] = temp;
        }
    }
}

cout << "Sorted array: ";
for (int i = 0; i < n; i++)
    cout << arr[i] << " ";
cout << endl;

return 0;

}