what is diffrence between linear and binary search in array
respect to operators?what kind of operator can be used in
both seach methods?
- 1 Answers
- 1939 Views
- I also Faced
- E-Mail Answers
Answer / Rohitash Kumar
Linear search and binary search are two different methods used to find a specific value within an array. Linear search iterates through the entire array sequentially until the target value is found, whereas binary search performs a more efficient search by repeatedly dividing the array in half.nIn both linear and binary search, comparison operators (such as '==', '<', '>') are used to compare array elements with the target value.
| Is This Answer Correct ? | 0 Yes | 0 No |
Are the expressions * ptr ++ and ++ * ptr same?
what is the coding of display the factorial of a number using array and function?
Can you please explain the difference between strcpy() and memcpy() function?
What is the difference between mpi and openmp?
How can I read/write structures from/to data files?
What was noalias and what ever happened to it?
Explain what are linked list?
what will be the output of "printf("%d%d",scanf("%d% d",&a,&b))".provide an explation regarding the question
what is the difference between const volatile int i & volatile const int j;
main() { int i=1; while (i<=5) { printf("%d",i); if (i>2) goto here; i++; } } fun() { here: printf("PP"); }
write a c code "if you give a any decimal number then print that number in english alphabet"? ex: i/p: 552 o/p: five hundred fifty two ...
program to get the remainder and quotant of given two numbers with out using % and / operators?
10 Answers College School Exams Tests, IBM,
C 
