Scribd
Upload
2 views

Lab Assignments_05

Uploaded by

hernotebook96
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Lab Assignments_05

Uploaded by

hernotebook96
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Name:-Devansh Singh Nikam

Enrollment no:-0801IT231043
B.Tech IInd year, Batch A2
Lab Assignments_05
Que1) Write a program the desired element from the given data using linear
search.

● Program:-
#include <stdio.h>
#include <stdlib.h>

int linearSearch(int* arr, int n, int target){


for(int i=0;i<n;i++){
if(arr[i]==target){
return i;
}
}
return -1;
}

void printArray(int arr[], int n) {


for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
printf("\n");
}

int main(){
int n;
printf("Enter the number of elements: ");
scanf("%d", &n);

int* arr=(int*)malloc(n*sizeof(int));

printf("Enter %d elements:\n",n);
for(int i=0;i<n;i++){
scanf("%d", &arr[i]);
}

printf("Array is: ");


printArray(arr, n);
Name:-Devansh Singh Nikam
Enrollment no:-0801IT231043
B.Tech IInd year, Batch A2
int target;
printf("Enter the target element: ");
scanf("%d", &target);

int result=linearSearch(arr,n,target);

if(result!=-1){
printf("Element found at index %d\n", result);
}
else{
printf("Element not found\n");
}

free(arr);

return 0;
}

● Output:-
Name:-Devansh Singh Nikam
Enrollment no:-0801IT231043
B.Tech IInd year, Batch A2

Que2) Write a program the desired element from the given data using binary
search.

● Program:-
#include <stdio.h>
#include <stdlib.h>

int binarySearch(int* arr, int n, int target) {


int left = 0;
int right = n - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (arr[mid] == target) {
return mid;
} else if (arr[mid] < target) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return -1;
}

void printArray(int arr[], int n) {


for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
printf("\n");
}

int main() {
int n;
printf("Enter the number of elements: ");
scanf("%d", &n);

int* arr = (int*)malloc(n * sizeof(int));


Name:-Devansh Singh Nikam
Enrollment no:-0801IT231043
B.Tech IInd year, Batch A2
printf("Enter %d elements in ascending order: ", n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}

printf("Array is: ");


printArray(arr, n);

int target;
printf("Enter the target element: ");
scanf("%d", &target);

int result = binarySearch(arr, n, target);


if (result == -1) {
printf("Element not found in the array\n");
} else {
printf("Element found at index %d\n", result);
}

free(arr);

return 0;
}

● Output:-

You might also like