-
Notifications
You must be signed in to change notification settings - Fork 4
/
5-searching-int-linear-binary.c
87 lines (71 loc) · 1.78 KB
/
5-searching-int-linear-binary.c
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
/*Searching:
Search for 77 using Linear/Binary Search.
*/
#include<stdio.h>
#include<stdlib.h>
void linearSearch(int arr[], int n, int search);
void binarySearch(int arr[], int n, int search);
int main()
{
int array[100], i, n, searchNum, select;
printf(" Enter the total number of element: ");
scanf("%d", &n);
printf("\n Enter %d number of elements: ", n);
for(i =0; i<n; i++){
scanf("%d", &array[i]);
}
printf("\n Enter number that you want to search: ");
scanf("%d", &searchNum);
printf("\n Select a method of searching\n");
printf("\n 1. Linear Search\n 2. Binary Search\nEnter your choice: ");
scanf("%d", &select);
switch(select)
{
case 1:
linearSearch(array, n, searchNum);
break;
case 2:
binarySearch(array, n, searchNum);
break;
default:
printf("\n Please enter valid number.\n");
break;
}
return 0;
}
void linearSearch(int arr[], int n, int search)
{
int i;
for(i=0; i<n; i++){
if(arr[i] == search){
printf("\n %d is FOUND at index array[%d].\n", search, i);
break;
}
}
if(i == n){
printf("\n %d is NOT FOUND.\n", search);
}
}
void binarySearch(int arr[], int n, int search)
{
int start, end, mid, i;
start = 0;
end = n-1;
mid = (start + end)/2;
while(start <= end){
if(arr[mid] > search){
end = mid - 1;
}
else if(arr[mid] == search){
printf("\n %d is FOUND at index array[%d]\n", search, mid);
break;
}
else{
start = mid + 1;
}
mid = (start + end) / 2;
}
if(start > end){
printf("\n %d in NOT FOUND\n", search);
}
}