|
1 |
| -#include<stdio.h> |
| 1 | +#include <stdio.h> |
2 | 2 |
|
3 | 3 | int BinarySearch(int array[], int size, int value) {
|
4 |
| - int start = 0; |
5 |
| - int end = size - 1; |
6 |
| - int middle = end / 2; |
| 4 | + int start = 0; |
| 5 | + int end = size - 1; |
| 6 | + int middle = end / 2; |
7 | 7 |
|
8 |
| - while (start < end && array[middle] != value) { |
9 |
| - // new start |
10 |
| - if (value > array[middle]) |
11 |
| - start = middle + 1; |
| 8 | + while (start < end && array[middle] != value) { |
| 9 | + // new start |
| 10 | + if (value > array[middle]) |
| 11 | + start = middle + 1; |
12 | 12 |
|
13 |
| - // new end |
14 |
| - if (value < array[middle]) |
15 |
| - end = middle - 1; |
| 13 | + // new end |
| 14 | + if (value < array[middle]) |
| 15 | + end = middle - 1; |
16 | 16 |
|
17 |
| - // new middle |
18 |
| - middle = (start + end) / 2; |
19 |
| - } |
| 17 | + // new middle |
| 18 | + middle = (start + end) / 2; |
| 19 | + } |
20 | 20 |
|
21 |
| - if (array[middle] == value) |
22 |
| - return middle; |
| 21 | + if (array[middle] == value) |
| 22 | + return middle; |
23 | 23 |
|
24 |
| - return -1; |
| 24 | + return -1; |
25 | 25 | }
|
26 | 26 |
|
27 | 27 | int main() {
|
28 |
| - int value; |
29 |
| - int array[] = {1, 5, 10, 12, 18, 22, 87, 90, 112, 129}; |
30 |
| - size_t size = sizeof(array) / sizeof(array[0]); |
| 28 | + int value; |
| 29 | + int array[] = {1, 5, 10, 12, 18, 22, 87, 90, 112, 129}; |
| 30 | + size_t size = sizeof(array) / sizeof(array[0]); |
31 | 31 |
|
32 |
| - printf("Please provide the number you want to value for: "); |
33 |
| - scanf("%d", &value); |
| 32 | + printf("Please provide the number you want to value for: "); |
| 33 | + scanf("%d", &value); |
34 | 34 |
|
35 |
| - int pos = BinarySearch(array, size, value); |
| 35 | + int pos = BinarySearch(array, size, value); |
36 | 36 |
|
37 |
| - if (pos != -1) |
38 |
| - printf("Found in position = %d.\nValue = %d\n", pos, array[pos]); |
39 |
| - else |
40 |
| - printf("Not found\n"); |
| 37 | + if (pos != -1) |
| 38 | + printf("Found in position = %d.\nValue = %d\n", pos, array[pos]); |
| 39 | + else |
| 40 | + printf("Not found\n"); |
41 | 41 |
|
42 |
| - return 0; |
| 42 | + return 0; |
43 | 43 | }
|
0 commit comments