What is the difference between a binary search and a
sequential search?
- 10 Answers
- 44260 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / muhammad abdul aleem
Binary Search | Sequential Search
1.Search All | 1.Search
2.Data should be in sorted | 2.Data can be in any order
order |
3. Only 1 When condition | 3. Any no. of when conditions
can be used | can be used.
4. Only '=' relational | 4. Any relational operator.
operator is used |
5. Access is faster | 5. Access is slow
6.Used for only single | 6. used for single/Multi
dimentional array | dimentional array.
| Is This Answer Correct ? | 124 Yes | 19 No |
Answer / guest
Binary search is search all. sequential search is the
linear serach.
Example for Search all: File contains 100 records. supose
if u r searching for 75 th record, first entire file
divided into two parts, it will check , whether record is
in first half or second.. like that file ds divded into
diffrent parts
sequential serach: if the file contains 100 records, spose
if u r looking for 75th record, it will start serach from
first record...
| Is This Answer Correct ? | 98 Yes | 12 No |
Answer / shyamendra
Binary search is attampt on file which is in sorted
order.Search All is the key word.Only one 'WHEN'
& 'AND'.Only '=' is used.
While Linear search can be attempt on any
file.Any logical operation is possible.Multiple 'WHEN' are
possible.Index is set to 1 before starting searching.When
table size is small then only we use this.
| Is This Answer Correct ? | 40 Yes | 14 No |
Answer / boxee
binary search is fast because
it check the element mid
is element is less
it set the beg
mid=(beg+end)/2;
if(value>a[mid])
{
beg=mid+1;
}
else
{
end=mid-1;
}
| Is This Answer Correct ? | 23 Yes | 0 No |
Answer / muthu
binary search runs in O(logn) time whereas linear search
runs in O(n) times thus binary search has better
performance.
| Is This Answer Correct ? | 36 Yes | 14 No |
Answer / sahil chawla
HI !!!!
I m Sahil Chawla
It is to be noted that in binary search MID=(start+end)/2
is to be found
but in linear search there is no such condition
| Is This Answer Correct ? | 18 Yes | 7 No |
Answer / anupam
binary search is performed by calculating mid point whereas sequential search is performed by sorting all elements.prior is the faster.
| Is This Answer Correct ? | 2 Yes | 9 No |
Answer / pratik gondaliya
with binary serch we can not get output faster because it is difficult to sort the character element.
with linear serch we can get output fastest.
example-: hello my name is pratik
| Is This Answer Correct ? | 6 Yes | 20 No |
Answer / a.r.rahman(music director
binary and sequensial search is bad.................
| Is This Answer Correct ? | 11 Yes | 48 No |
What are the divisions in a cobol program?
what is record label is empty or standard in file description of data division?
can we declare s9(9)v9(9) in cobol ? if yes how many bytes it will occupy ?(urgent plz answer it)
Explain about different table spaces.
Explain sorting techniques in cobol program? Provide the sort file definition, the sort statement, its syntax and meaning
explain sorting techniques in cobol program?
created cluster using IDCAMS ..that is empty ..when i write a program for read using Input ..wil it open the cluster or gives any error?
how to crack cts interview apps? NOVEMBER 21 2010
How to delete the records of a dataset through cobol programme?We should not use jcl utilitities like IDCAMS.
I have a field with data type X(10). I want to perform arithmetic operation on this field? I tried doing it by moving the value into a numeric field. but it didn't work out. I am getting a S0C7 abend. Pls let me know if there is any way of getting this done?
IF there 5 to 6 files in a JCL and there is some space abends, how can we identify which file has space abend and what can be done to get off that abend or rectify that abend.
When can the USING phrase be included in the call statement ?
COBOL 
