Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Busqueda binaria version iterativa
#include <stdio.h> #define M 6 int busquedaBinariaIt(int *, int, int); int main(void) { int A[M] = {10, 20, 30, 40, 50, 60}; int clave = 50; int posicion = busquedaBinariaIt(A, M - 1, clave); if (posicion == -1) printf("%d NO ESTA EN VECTOR", clave); else printf("%d ESTA EN EL VECTOR EN POSICION %d", clave, posicion); return 0; } int busquedaBinariaIt(int * A, int N, int target) { int start; int end; int middle; start = 0; end = N; while ( start <= end) { middle = (start + end) / 2; if (A[middle] == target) return middle; else if (A[middle] > target) end = middle - 1; else start = middle + 1; } return -1; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
pseudo hw v.05
Beginning linux
Matriz funcona medio raor aslñdk
150116_FactorialPrimo
Midterm practice 2
A_141201_MatrizTodosDistintos
Lab6 v1.1 Sin,cos,tan,cot
is_there_segfault
Newtons method
recurs fibo1
Please log in to post a comment.