-
Notifications
You must be signed in to change notification settings - Fork 0
/
test_3.c
35 lines (26 loc) · 1020 Bytes
/
test_3.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
#include <stdio.h>
int n = 14;//num of elements
int search(int arr[], int searched_val, int pos, int depth_count){
depth_count = depth_count * 2;
if(searched_val == arr[pos]){
return 1;//element found;
}
else if(searched_val < arr[pos]){
search(arr, searched_val, pos - (n/depth_count), depth_count);// move position to down by increment of 1/x
}
else if(searched_val > arr[pos]){
search(arr, searched_val, pos + (n/depth_count), depth_count);// move position to up by increment of 1/x
}
else
return 0;
}
int main(){
int arr[] = { 0,1,2,3,4,5,6,7,8,9,10,11,12,13};
int searched_val;
int pos = n/2;
int depth_count = 2;//keep track of how much is needed to add when search inside list happens over time
printf("%d\n\n",search(arr, 7,pos, depth_count));
printf("%d\n\n",search(arr, 8,pos, depth_count));
printf("%d\n\n",search(arr, 8,pos, depth_count));
printf("%d\n\n",search(arr, 5,pos, depth_count));
}