mirror of
https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git
synced 2023-10-11 15:56:24 +08:00
8d240037b3
1) Easy logic built 2) error minimized: as array is increasing in above example it might not always be increasing.just replace 47 by 2 then run above program it will give an incorrect ans. but in improvised case it is minimized. 3)we are scanning input from user so, more saturated 4)'position' is more reliable than 'index'. |
||
---|---|---|
.. | ||
Binary_Search.c | ||
fibonacciSearch.c | ||
interpolation_search.c | ||
Jump_Search.c | ||
LinearSearch.c | ||
Other_Binary_Search.c |