Implementation
Binary Search in C Programming
#include <stdio.h>
int main() {
int n, i, lmnt, c = 0, mid, s, e;
printf("Enter the number of elements in the array: ");
scanf("%d", &n);
int arr[n];
printf("Enter %d elements in sorted order: ", n);
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
printf("Enter the element to search: ");
scanf("%d", &lmnt);
s = 0;
e = n - 1;
while (s <= e) {
mid = (s + e) / 2;
if (arr[mid] == lmnt) {
printf("\nFound at index: %d\n", mid);
c = 1;
break;
} else if (arr[mid] < lmnt) {
s = mid + 1;
} else { Output
e = mid - 1;
if (c == 0) {
printf("Not found\n");
return 0;
}
Bubble Sort in C Programming
#include <stdio.h>
int main() {
int arr[100];
int n, temp;
printf("Enter the number of elements: ");
scanf("%d", &n);
printf("Enter %d integers:\n", n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
for (int i = 0; i < n - 1; i++) {
for (int k = 0; k < n - i - 1; k++) {
if (arr[k] > arr[k + 1]) {
temp = arr[k];
arr[k] = arr[k + 1];
arr[k + 1] = temp;
}
Output
}
printf("\nSorted array: ");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
printf("\n");
return 0;
}
Sorting and Finding Positions of Newly Added Elements in an Array
#include <stdio.h>
int main() {
int n, numToAdd;
printf("Enter the size of the array: ");
scanf("%d", &n);
int arr[n];
printf("Enter %d elements of the array: ", n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
printf("\nEnter the number of elements you want to add: ");
scanf("%d", &numToAdd);
int newArr[n + numToAdd];
int addedElements[numToAdd];
for (int i = 0; i < n; i++) {
newArr[i] = arr[i];
}
printf("Enter the %d numbers to add: ", numToAdd);
for (int i = 0; i < numToAdd; i++) {
scanf("%d", &addedElements[i]);
newArr[n + i] = addedElements[i];
}
int size = n + numToAdd;
for (int i = 0; i < size - 1; i++) {
for (int j = 0; j < size - i - 1; j++) {
if (newArr[j] > newArr[j + 1]) {
int temp = newArr[j];
Output
newArr[j] = newArr[j + 1];
newArr[j + 1] = temp;
}
}
}
printf("\nSorted array:\n ");
for (int i = 0; i < size; i++) {
printf("%d ", newArr[i]);
}
printf("\n");
printf("\nPositions of newly added numbers:\n");
for (int i = 0; i < numToAdd; i++) {
int pos = -1;
for (int j = 0; j < size; j++) {
if (newArr[j] == addedElements[i]) {
pos = j + 1;
break;
}
}
printf(" Position of %d: %d\n", addedElements[i], pos);
}
return 0;
}
